Abstract is missing.
- The Maximum Clique ProblemImmanuel M. Bomze, Marco Budinich, Panos M. Pardalos, Marcello Pelillo. 1-74 [doi]
- Linear Assignment Problems and ExtensionsRainer E. Burkard, Eranda Çela. 75-149 [doi]
- Bin Packing Approximation Algorithms: Combinatorial AnalysisEdward G. Coffman Jr., Gábor Galambos, Silvano Martello, Daniele Vigo. 151-207 [doi]
- Feedback Set ProblemsPaola Festa, Panos M. Pardalos, Mauricio G. C. Resende. 209-258 [doi]
- Neural Networks Approaches for Combinatorial Optimization ProblemsTheodore B. Trafalis, Suat Kasap. 259-293 [doi]
- Frequency Assignment ProblemsRobert A. Murphey, Panos M. Pardalos, Mauricio G. C. Resende. 295-377 [doi]
- Algorithms for the Satisfiability (SAT) ProblemJun Gu, Paul W. Purdom, John Franco, Benjamin W. Wah. 379-572 [doi]
- The Steiner Ratio of L p -planesJens Albrecht, Dietmar Cieslik. 573-589 [doi]
- A Cogitative Algorithm for Solving the Equal Circles Packing ProblemWenqi Huang, Yu-Liang Wu, C. K. Wong. 591-605 [doi]