Abstract is missing.
- Structure Theorems for Optimum Hyperpaths in Directed HypergraphsGiorgio Ausiello, Giuseppe F. Italiano, Luigi Laura, Umberto Nanni, Fabiano Sarracco. 1-14 [doi]
- Branch-and-Price Guided Search - (Extended Abstract)Mike Hewitt, George L. Nemhauser, Martin W. P. Savelsbergh. 15-18 [doi]
- The New Faces of Combinatorial OptimizationChristos H. Papadimitriou. 19-23 [doi]
- Models and Algorithms for the Train Unit Assignment ProblemValentina Cacchiani, Alberto Caprara, Paolo Toth. 24-35 [doi]
- The Minimum Stabbing Triangulation Problem: IP Models and Computational EvaluationBreno Piva, Cid C. de Souza. 36-47 [doi]
- Orbital ShrinkingMatteo Fischetti, Leo Liberti. 48-58 [doi]
- Using Symmetry to Optimize Over the Sherali-Adams RelaxationJames Ostrowski. 59-70 [doi]
- A Second-Order Cone Programming Approximation to Joint Chance-Constrained Linear ProgramsJianqiang Cheng, Céline Gicquel, Abdel Lisser. 71-80 [doi]
- Semidefinite Relaxations for Mixed 0-1 Second-Order Cone ProgramAgnès Gorge, Abdel Lisser, Riadh Zorgati. 81-92 [doi]
- The Non-Disjoint m-Ring-Star Problem: Polyhedral Results and SDH/SONET Network DesignPierre Fouilhoux, Aurélien Questel. 93-104 [doi]
- The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple StacksSylvie Borne, Roland Grappe, Mathieu Lacroix. 105-116 [doi]
- Polyhedral Analysis and Branch-and-Cut for the Structural Analysis ProblemMathieu Lacroix, Ali Ridha Mahjoub, Sébastien Martin. 117-128 [doi]
- Extended Formulations, Nonnegative Factorizations, and Randomized Communication ProtocolsYuri Faenza, Samuel Fiorini, Roland Grappe, Hans Raj Tiwary. 129-140 [doi]
- An Algebraic Approach to Symmetric Extended FormulationsGábor Braun, Sebastian Pokutta. 141-152 [doi]
- Dual Consistent Systems of Linear Inequalities and Cardinality Constrained PolytopesSatoru Fujishige, Jens Maßberg. 153-164 [doi]
- Minimum Ratio Cover of Matrix Columns by Extreme Rays of Its Induced ConeAlexandre S. Freire, Vicente Acuña, Pilu Crescenzi, C. E. Ferreira, Vincent Lacroix, Paulo Vieira Milreu, Eduardo Moreno, Marie-France Sagot. 165-177 [doi]
- Gap Inequalities for the Max-Cut Problem: A Cutting-Plane AlgorithmLaura Galli, Konstantinos Kaparis, Adam N. Letchford. 178-188 [doi]
- Fast Separation Algorithms for Three-Index Assignment ProblemsTrivikram Dokka, Ioannis Mourtos, Frits C. R. Spieksma. 189-200 [doi]
- On the Hop Constrained Steiner Tree Problem with Multiple Root NodesLuis Gouveia, Markus Leitner, Ivana Ljubic. 201-212 [doi]
- Theoretical Investigation of Aggregation in Pseudo-polynomial Network-Flow ModelsMarie-Emilie Voge, François Clautiaux. 213-224 [doi]
- On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree ProblemMario Ruthmair, Günther R. Raidl. 225-236 [doi]
- A Parallel Lagrangian Relaxation Algorithm for the Min-Degree Constrained Minimum Spanning Tree ProblemLeonardo Conegundes Martinez, Alexandre Salles da Cunha. 237-248 [doi]
- Layered Formulation for the Robust Vehicle Routing Problem with Time WindowsAgostinho Agra, Marielle Christiansen, Rosa M. V. Figueiredo, Lars Magnus Hvattum, Michael Poss, Cristina Requejo. 249-260 [doi]
- Models and Algorithms for Robust Network Design with Several Traffic ScenariosEduardo Álvarez-Miranda, Valentina Cacchiani, Tim Dorneth, Michael Jünger, Frauke Liers, Andrea Lodi, Tiziano Parriani, Daniel R. Schmidt. 261-272 [doi]
- Aircraft Sequencing Problems via a Rolling Horizon AlgorithmFabio Furini, Carlo Alfredo Persiani, Paolo Toth. 273-284 [doi]
- On the Solution of a Graph Partitioning Problem under Capacity ConstraintsPierre Bonami, Viet Hung Nguyen, Michel Klein, Michel Minoux. 285-296 [doi]
- Sum-Max Graph Partitioning ProblemR. Watrigant, Marin Bougeret, Rodolphe Giroudeau, Jean-Claude König. 297-308 [doi]
- The Packing Coloring Problem for (q, q-4) GraphsGabriela R. Argiroffo, Graciela L. Nasini, P. Torres. 309-319 [doi]
- Selective Graph Coloring in Some Special Classes of GraphsMarc Demange, Jérôme Monnot, Petrica Pop, Bernard Ries. 320-331 [doi]
- Graph Orientations Optimizing the Number of Light or Heavy VerticesYuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono. 332-343 [doi]
- Constrained Matching Problems in Bipartite GraphsMonaldo Mastrolilli, Georgios Stamoulis. 344-355 [doi]
- The Gram Dimension of a GraphMonique Laurent, Antonios Varvitsiotis. 356-367 [doi]
- Exploiting a Hypergraph Model for Finding Golomb RulersManuel Sorge, Hannes Moser, Rolf Niedermeier, Mathias Weller. 368-379 [doi]
- Counting Homomorphisms via Hypergraph-Based Structural RestrictionsTommy Färnqvist. 380-391 [doi]
- Hardness Results for the Probabilistic Traveling Salesman Problem with DeadlinesDennis Weyland, Roberto Montemanni, Luca Maria Gambardella. 392-403 [doi]
- Differential Approximation of the Multiple Stacks TSPSophie Toulouse. 404-415 [doi]
- Completion Time Scheduling and the WSRPT AlgorithmBo Xiong, Christine Chung. 416-426 [doi]
- Two-Agent Scheduling on an Unbounded Serial Batching MachineMikhail Y. Kovalyov, Ammar Oulamara, Ameur Soukhal. 427-438 [doi]
- Second-Price Ad Auctions with Binary Bids and Markets with Good CompetitionCristina G. Fernandes, Rafael C. S. Schouery. 439-450 [doi]
- Towards Minimizing k-Submodular FunctionsAnna Huber, Vladimir Kolmogorov. 451-462 [doi]
- Recognition Algorithms for Binary Signed-Graphic MatroidsKonstantinos Papalamprou, Leonidas S. Pitsoulis. 463-474 [doi]