- ALENEX 2001 Proceedings, Springer Lecture Notes in Computer Science 2153, pp. 3259 The Asymmetric Traveling Salesman Problem
- To appear in the Proceedings of ALENEX2003 The CuttingStock Approach to Bin Packing
- DRAFT (approximately final) of a chapter that appeared in "The Traveling Salesman Problem and its Variations,"Gutin
- Proc. 18th ACMSIAM Symp. on Discrete Algorithms (2007), 10661075. Compressing Rectilinear Pictures and Minimizing Access Control Lists
- Final draft of paper that appeared in ALGORITHMICA 31:2 (2001), 115-138 Bounded Space On-Line Bin Packing
- Proc. 32nd ACM Symp. on Theory of Computing (2000), 208217 On the SumofSquares Algorithm for Bin Packing
- 8th DIMACS Implementation Challenge: The Traveling Salesman Problem
- Published in J. ALGORITHMS 3, 381-395 (1982) The NP-Completeness Column: An Ongoing Guide
- On the SumofSquares Algorithm for Bin Packing JANOS CSIRIK
- Final draft of paper that appeared in SIAM J. Comput. 23 (1994), 864894 The Complexity of Multiterminal Cuts
- Disjoint-Path Facility Location: Theory and Practice Lee Breslau
- Published in J. ALGORITHMS 5, 433-447 (1984) The NP-Completeness Column: An Ongoing Guide
- A Multilevel Approach to the Travelling Salesman Problem Chris Walshaw
- Submitted to JACM The Geometric Maximum Traveling Salesman Problem
- Implementation Report: HyperOpt Authors: E.K. Burke, P. Cowling and R. Keuthen
- Published in J. ALGORITHMS 3, 89-99 (1982) The NP-Completeness Column: An Ongoing Guide
- Published version appears in RANDOM STRUCTURES AND ALGORITHMS 10 (1997), 69110 Bin Packing with Discrete Item Sizes,
- Published version appears in J. ALGORITHMS 18 (1995), 432479 Data Structures for Traveling Salesmen*
- Published in ACM TRANSACTIONS ON ALGORITHMS 1:1, 160-176 (2005) The NP-Completeness Column
- On the Sum-of-Squares Algorithm for Bin Packing JANOS CSIRIK
- On the SumofSquares Algorithm for Bin Packing JANOS CSIRIK
- Core Theory in the Year 2000 and Beyond Avi Wigderson, et. al
- To appear in Proc. 11th ACMSIAM Symp. on Discrete Algorithms, San Francisco, CA c fl SIAM 2000.
- DIMACS TSP Implementation Challenge 2000 David M. Neto
- ROUGH DRAFT of Full Paper Compressing Rectilinear Pictures and
- The Traveling Salesman Problem: A Case Study in Local Optimization
- Published in ACM TRANSACTIONS ON ALGORITHMS 3:2 (2007), Article 24 The NP-Completeness Column
- A Theoretician's Guide to the Experimental Analysis of Algorithms
- Final draft of paper that appeared in SIAM J. Comput. 23 (1994), 864-894 The Complexity of Multiterminal Cuts
- ROUGH DRAFT of Full Paper Compressing Rectilinear Pictures and
- Disjoint-Path Facility Location: Theory and Practice Lee Breslau
- On the Sum-of-Squares Algorithm for Bin Packing JANOS CSIRIK
- SIAM REVIEW c 2002 Society for Industrial and Applied Mathematics Vol. 44, No. 1, pp. 95108
- Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms (1996), 341-350 Asymptotic Experimental Analysis
- Published in J. ALGORITHMS 4, 286-300 (1983) The NP-Completeness Column: An Ongoing Guide
- Published in J. ALGORITHMS 6, 145-159 (1985) The NP-Completeness Column: An Ongoing Guide
- Published in J. ALGORITHMS 6, 291-305 (1985) The NP-Completeness Column: An Ongoing Guide
- Published in J. ALGORITHMS 7, 289-305 (1986) The NP-Completeness Column: An Ongoing Guide
- Published in J. ALGORITHMS 7, 584-601 (1986) The NP-Completeness Column: An Ongoing Guide
- Published in J. ALGORITHMS 8, 285-303 (1987) The NP-Completeness Column: An Ongoing Guide
- Published in J. ALGORITHMS 8, 438-448 (1987) The NP-Completeness Column: An Ongoing Guide
- Published in ACM TRANSACTIONS ON ALGORITHMS 2:3, 473-489 (2006) The NP-Completeness Column
- 8th DIMACS Implementation Challenge: The Traveling Salesman Problem
- Published in J. ALGORITHMS 2, 393-405 (1981) The NP-Completeness Column: An Ongoing Guide
- Published in J. ALGORITHMS 4, 189-203 (1983) The NP-Completeness Column: An Ongoing Guide
- The Cutting-Stock Approach to Bin Packing: Theory and Experiments
- Published in J. ALGORITHMS 9, 426-444 (1988) The NP-Completeness Column: An Ongoing Guide
- 1 ZachariasenDam Tabu Search These results are obtained using the original implementation described in
- From Algorithm Engineering and Experimentation, Goodrich & McGeoch, Eds., Springer LNCS 1619, 1999, pp 246265
- DRAFT of a paper that appeared in the Proceedings of the 5th and 6th DIMACS Implementation Challenges, Goldwasser, Johnson, and McGeoch,
- Nearoptimal Intraprocedural Branch Alignment Cliff Young + , David S. Johnson * , David R. Karger # , and Michael D. Smith +
- Integer Programming and Combinatorial Optimization (Bixby et al. eds.), Springer LNCS 1412, 1998, 195201 The Maximum Traveling Salesman Problem
- Published in J. ALGORITHMS 6, 434-451 (1985) The NP-Completeness Column: An Ongoing Guide
- The NP-Completeness Column: An Ongoing Guide DAVID S. JOHNSON
- Published in J. ALGORITHMS 5, 595-609 (1984) The NP-Completeness Column: An Ongoing Guide
- Published in J. ALGORITHMS 11, 144-151 (1990) The NP-Completeness Column: An Ongoing Guide
- Final draft of paper that appeared in ALGORITHMICA 31:2 (2001), 115138 Bounded Space OnLine Bin Packing
- arXiv:cs.DS/0509031v112Sep2005 On the Worst-case Performance of the
- Published in J. ALGORITHMS 3, 182-195 (1982) The NP-Completeness Column: An Ongoing Guide
- Published in J. ALGORITHMS 4, 87-100 (1983) The NP-Completeness Column: An Ongoing Guide
- Published in J. ALGORITHMS 5, 284-299 (1984) The NP-Completeness Column: An Ongoing Guide
- Scalable and Accurate Identification of AS-Level Forwarding Paths
- SIAM REVIEW c # 2002 Society for Industrial and Applied Mathematics
- Published in J. ALGORITHMS 5, 147-160 (1984) The NP-Completeness Column: An Ongoing Guide
- Published in J. ALGORITHMS 4, 397-411 (1983) The NP-Completeness Column: An Ongoing Guide
- DRAFT (approximately final) of a chapter that appeared in "The Traveling Salesman Problem and its Variations,"Gutin
- To appear in Proc. 12th ACMSIAM Symp. on Discrete Algorithms, Washington, DC c fl SIAM 2001
- Proceedings of the 7th Annual ACMSIAM Symposium on Discrete Algorithms (1996), 341350 Asymptotic Experimental Analysis
- Implementation Report: Variable Neighbourhood Search Authors: E.K. Burke, P. Cowling and R. Keuthen
- Submitted to ALGORITHMICA Minimizing Channel Density for Gridless Embeddings
- Near-optimal Intraprocedural Branch Alignment Cliff Young
- Compressing Large Boolean Matrices Using Reordering David Johnson
- A Multilevel LinKernighanHelsgaun Algorithm for the Travelling Salesman Problem
- Published in J. ALGORITHMS 13, 502-524 (1992) The NP-Completeness Column: An Ongoing Guide
- Efficient and Robust Streaming Provisioning in VPNs Z. Morley Mao
- Published version appears in SIAM J. DISCRETE MATHEMATICS 13 (2000), 384402 Bin Packing with Discrete Item Sizes,