Abstract is missing.
- p-Median PolytopesMourad Baïou, Francisco Barahona. 1-31 [doi]
- Facet Generating TechniquesSylvia C. Boyd, William R. Pulleyblank. 33-55 [doi]
- Antimatroids, Betweenness, ConvexityVasek Chvátal. 57-64 [doi]
- Euler ComplexesJack Edmonds. 65-68 [doi]
- Strongly Polynomial Algorithm for the Intersection of a Line with a PolymatroidJean Fonlupt, Alexandre Skoda. 69-85 [doi]
- A Survey on Covering Supermodular FunctionsAndrás Frank, Tamás Király. 87-126 [doi]
- Theory of Principal Partitions RevisitedSatoru Fujishige. 127-162 [doi]
- Locally Dense Independent Sets in Regular Graphs of Large Girth - An Example of a New ApproachFrank Göring, Jochen Harant. 163-183 [doi]
- Linear Time Approximation Algorithms for Degree Constrained Subgraph ProblemsStefan Hougardy. 185-200 [doi]
- The Unbounded Knapsack ProblemT. C. Hu, Leo Landa, Man-tak Shing. 201-217 [doi]
- Recent Developments in Discrete Convex AnalysisKazuo Murota. 219-260 [doi]
- Multiflow Feasibility: An Annotated TableauGuyslain Naves, András Sebö. 261-283 [doi]
- Many Facets of DualitiesJaroslav Nesetril. 285-302 [doi]
- On the Structure of Graphs Vertex Critical with Respect to Connected DominationMichael D. Plummer. 303-315 [doi]
- LS-LIB: A Library of Tools for Solving Production Planning ProblemsYves Pochet, Mathieu Van Vyve. 317-346 [doi]
- From Spheres to Spheropolyhedra: Generalized Distinct Element Methodology and Algorithm AnalysisLionel Pournin, Thomas M. Liebling. 347-363 [doi]
- Graphic Submodular Function Minimization: A Graphic Approach and ApplicationsMyriam Preissmann, András Sebö. 365-385 [doi]
- Matroids - the Engineers' RevengeAndrás Recski. 387-398 [doi]
- On the Relative Complexity of 15 Problems Related to 0/1-Integer ProgrammingAndreas S. Schulz. 399-428 [doi]
- Single-Sink Multicommodity Flow with Side ConstraintsF. Bruce Shepherd. 429-450 [doi]
- An Introduction to Network Flows over TimeMartin Skutella. 451-482 [doi]
- Edge-Connectivity Augmentations of Graphs and HypergraphsZoltán Szigeti. 483-521 [doi]
- Some Problems on Approximate Counting in Graphs and MatroidsDominic Welsh. 523-544 [doi]