Abstract is missing.
- Polynomially Solvable Cases of the Simple Plant Location ProblemAlexander A. Ageev, Vladimir L. Beresnev. 1-6
- A Genetic Algorithm for the Assembly Line Balancing ProblemEdward J. Anderson, Michael C. Ferris. 7-18
- On Identifying in Polynomial Time Violated Subtour Elimination and Precedence Forcing Constraints for the Sequential Ordering ProblemNorbert Ascheuer, Laureano F. Escudero, Martin Grötschel, Mechthild Stoer. 19-28
- Factoring Cartesian-Product Graphs at Logarithmic Cost per EdgeFranz Aurenhammer, Johann Hagauer, Wilfried Imrich. 29-44
- Finding Out Whether a Valid Inequality is Facet DefiningEgon Balas. 45-59
- Some Provably Hard Crossing Number ProblemsDaniel Bienstock. 61-83
- Polyhedral Results for the Precedence-Constrained Knapsack ProblemE. Andrew Boyd. 85-100
- Modular Arithmetic and Randomization for Exact Matroid ProblemsPaolo M. Camerini, Giulia Galbiati, Francesco Maffioli. 101-113
- Ancestor Tree for Arbitrary Multi-Terminal Cut FunctionsChung-Kuan Cheng, T. C. Hu. 115-127
- The Graphical Asymmetric Traveling Salesman PolyhedronSunil Chopra, Giovanni Rinaldi. 129-145
- A Decomposition Theorem for Balanced MatricesMichele Conforti, Gérard Cornuéjols. 147-169
- New Results on Facets of the Cut ConeMichel Deza, Monique Laurent. 171-184
- The Fastest Algorithm for the Pert Problem with AND-and OR-Nodes (The New-Product-New-Technology Problem)E. A. Dinic. 185-187
- Probabilistic Analysis of the Generalised Assignment ProblemMartin E. Dyer, Alan M. Frieze. 189-200
- On the Clique-Rank and the Coloration of Perfect GraphsJean Fonlupt, András Sebö. 201-216
- Conservative Weightings and Ear-Decompositions of GraphsAndrás Frank. 217-229
- A Survey of Some Results in Discrete OptimisationA. A. Fridman, Eugene Levner. 231-235
- Bounds for the Quadratic Assignment Problems Using Continuous Optimization TechniquesScott W. Hadley, Franz Rendl, Henry Wolkowicz. 237-248
- Near-Optimal Sequencing with Precedence ConstraintsLeslie A. Hall, David B. Shmoys. 249-260
- On the Impossibility of Strongly Polynomial Algorithms for the Allocation Problem and its ExtensionsDorit S. Hochbaum. 261-273
- Shellability of Oriented MatroidsWinfried Hochstättler. 275-281
- Minimizing Maximum Earliness and Maximum Lateness on a Single MachineJ. A. Hoogeveen. 283-295
- O(m/cdotn) Isomorphism Algorithms for Circular-Arc Graphs and Circle GraphsWen-Lian Hsu. 297-311
- Column Generation Methods for Probabilistic LogicBrigitte Jaumard, Pierre Hansen, Marcus Poggi de Aragão. 313-331
- Computational Experience with an Interior Point Algorithm on the Satisfiability ProblemAnil P. Kamath, Narendra Karmarkar, K. G. Ramakrishnan, Mauricio G. C. Resende. 333-349
- An Interior-Point Approach to NP-Complete ProblemsNarendra Karmarkar. 351-366
- Flow in Planar Graphs with Vertex CapacitiesSamir Khuller, Joseph Naor. 367-384
- On the Radon Number of the Integer LatticeShmuel Onn. 385-396
- Vertex Disjoint Channel Routing on Two LayersAndrás Recski, Frank Strzyzewski. 397-405
- Perfection, Parity, Planarity, and Packing PathsBruce A. Reed. 407-419
- Max-Balanced FlowsMichael H. Schneider, Mark E. Hartmann, Hans Schneider. 421-429
- Hilbert Bases, Caratheodory s Theorem and Combinatorial OptimizationAndrás Sebö. 431-455
- Stability Critical Graphs and Even Subdivisions of K_4E. C. Sewell, Leslie E. Trotter Jr.. 457-466
- Integer Solution to Synthesis of Communication NetworksS. Sridhar, R. Chandrasekaran. 467-483
- Scheduling Multiple Variable-Speed MachinesMichael A. Trick. 485-494
- Dual Decomposition of Single Machine Scheduling ProblemsSteef L. van de Velde. 495-507
- A Theory of Alternating Paths and Blossoms for Proving Correctness of the O(/surdVE) General Graph Matching AlgorithmVijay V. Vazirani. 509-530