Combinatorial optimization Second International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised selected papers /
This book constitutes the thoroughly refereed post-conference proceedings of the Second International Symposium on Combinatorial Optimization, ISCO 2012, held in Athens, Greece, in April 2012. The 37 revised full papers presented together with 4 invited talks were carefully reviewed and selected fro...
| Corporate Authors: | ISCO (Symposium : Combinatorial optimization) Athens, Greece) |
|---|---|
| Other Authors: | ISCO (Symposium : Combinatorial optimization), Mahjoub, A. Ridha, SpringerLink (Online service) |
| Format: | eBook |
| Language: | English |
| Published: |
Berlin ; New York :
Springer,
©2012.
Berlin ; New York : [2012] |
| Physical Description: |
1 online resource (xiv, 476 pages) : illustrations. |
| Series: |
Lecture notes in computer science ;
7422. LNCS sublibrary. Theoretical computer science and general issues. |
| Subjects: |
Table of Contents:
- Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs /
- Giorgio Ausiello, Giuseppe F. Italiano, Luigi Laura, Umberto Nanni and Fabiano Sarracco
- Branch-and-Price Guided Search
- (Extended Abstract) /
- Mike Hewitt, George L. Nemhauser and Martin Savelsbergh
- The New Faces of Combinatorial Optimization /
- Christos H. Papadimitriou
- Models and Algorithms for the Train Unit Assignment Problem /
- Valentina Cacchiani, Alberto Caprara and Paolo Toth
- The Minimum Stabbing Triangulation Problem: IP Models and Computational Evaluation /
- Breno Piva and Cid C. de Souza
- Orbital Shrinking /
- Matteo Fischetti and Leo Liberti
- Using Symmetry to Optimize Over the Sherali-Adams Relaxation /
- James Ostrowski
- A Second-Order Cone Programming Approximation to Joint Chance-Constrained Linear Programs /
- Jianqiang Cheng, Céline Gicquel and Abdel Lisser
- Semidefinite Relaxations for Mixed 0-1 Second-Order Cone Program /
- Agnès Gorge, Abdel Lisser and Riadh Zorgati
- The Non-Disjoint m-Ring-Star Problem: Polyhedral Results and SDH/SONET Network Design /
- Pierre Fouilhoux and Aurélien Questel
- The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks /
- Sylvie Borne, Roland Grappe and Mathieu Lacroix
- Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem /
- Mathieu Lacroix, A. Ridha Mahjoub and Sébastien Martin
- Extended Formulations, Nonnegative Factorizations, and Randomized Communication Protocols /
- Yuri Faenza, Samuel Fiorini, Roland Grappe and Hans Raj Tiwary
- An Algebraic Approach to Symmetric Extended Formulations /
- Gábor Braun and Sebastian Pokutta
- Dual Consistent Systems of Linear Inequalities and Cardinality Constrained Polytopes /
- Satoru Fujishige and Jens Massberg
- Minimum Ratio Cover of Matrix Columns by Extreme Rays of Its Induced Cone /
- A.S. Freire, V. Acuña, P. Crescenzi, C.E. Ferreira and V. Lacroix, et al.
- Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm /
- Laura Galli, Konstantinos Kaparis and Adam N. Letchford
- Fast Separation Algorithms for Three-Index Assignment Problems /
- Trivikram Dokka, Ioannis Mourtos and Frits C.R. Spieksma
- On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes /
- Luis Gouveia, Markus Leitner and Ivana Ljubić
- Theoretical Investigation of Aggregation in Pseudo-polynomial Network-Flow Models /
- Marie-Emilie Voge and François Clautiaux.
- On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem /
- Mario Ruthmair and Günther R. Raidl
- A Parallel Lagrangian Relaxation Algorithm for the Min-Degree Constrained Minimum Spanning Tree Problem /
- Leonardo Conegundes Martinez and Alexandre Salles da Cunha
- Layered Formulation for the Robust Vehicle Routing Problem with Time Windows /
- Agostinho Agra, Marielle Christiansen, Rosa Figueiredo, Lars Magnus Hvattum and Michael Poss, et al.
- Models and Algorithms for Robust Network Design with Several Traffic Scenarios /
- Eduardo Álvarez-Miranda, Valentina Cacchiani, Tim Dorneth, Michael Jünger and Frauke Liers, et al.
- Aircraft Sequencing Problems via a Rolling Horizon Algorithm /
- Fabio Furini, Carlo Alfredo Persiani and Paolo Toth
- On the Solution of a Graph Partitioning Problem under Capacity Constraints /
- Pierre Bonami, Viet Hung Nguyen, Michel Klein and Michel Minoux
- Sum-Max Graph Partitioning Problem /
- R. Watrigant, M. Bougeret, R. Giroudeau and J. -C. König
- The Packing Coloring Problem for (q, q-4) Graphs /
- G. Argiroffo, G. Nasini and P. Torres
- Selective Graph Coloring in Some Special Classes of Graphs /
- Marc Demange, Jérôme Monnot, Petrica Pop and Bernard Ries
- Graph Orientations Optimizing the Number of Light or Heavy Vertices /
- Yuichi Asahiro, Jesper Jansson, Eiji Miyano and Hirotaka Ono
- Constrained Matching Problems in Bipartite Graphs /
- Monaldo Mastrolilli and Georgios Stamoulis
- The Gram Dimension of a Graph /
- Monique Laurent and Antonios Varvitsiotis
- Exploiting a Hypergraph Model for Finding Golomb Rulers /
- Manuel Sorge, Hannes Moser, Rolf Niedermeier and Mathias Weller
- Counting Homomorphisms via Hypergraph-Based Structural Restrictions /
- Tommy Färnqvist
- Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines /
- Dennis Weyland, Roberto Montemanni and Luca Maria Gambardella
- Differential Approximation of the Multiple Stacks TSP /
- Sophie Toulouse
- Completion Time Scheduling and the WSRPT Algorithm /
- Bo Xiong and Christine Chung
- Two-Agent Scheduling on an Unbounded Serial Batching Machine /
- Mikhail Y. Kovalyov, Ammar Oulamara and Ameur Soukhal
- Second-Price Ad Auctions with Binary Bids and Markets with Good Competition /
- Cristina G. Fernandes and Rafael C.S. Schouery
- Towards Minimizing k-Submodular Functions /
- Anna Huber and Vladimir Kolmogorov
- Recognition Algorithms for Binary Signed-Graphic Matroids /
- Konstantinos Papalamprou and Leonidas Pitsoulis.