default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISCO 2012: Athens, Greece
- Ali Ridha Mahjoub, Vangelis Markakis, Ioannis Milis, Vangelis Th. Paschos:
Combinatorial Optimization - Second International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7422, Springer 2012, ISBN 978-3-642-32146-7
Invited Talks
- Giorgio Ausiello, Giuseppe F. Italiano
, Luigi Laura, Umberto Nanni, Fabiano Sarracco:
Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs. 1-14 - Mike Hewitt, George L. Nemhauser, Martin W. P. Savelsbergh:
Branch-and-Price Guided Search - (Extended Abstract). 15-18 - Christos H. Papadimitriou:
The New Faces of Combinatorial Optimization. 19-23 - Valentina Cacchiani, Alberto Caprara, Paolo Toth:
Models and Algorithms for the Train Unit Assignment Problem. 24-35
Contributed Talks
- Breno Piva, Cid C. de Souza:
The Minimum Stabbing Triangulation Problem: IP Models and Computational Evaluation. 36-47 - Matteo Fischetti, Leo Liberti:
Orbital Shrinking. 48-58 - James Ostrowski:
Using Symmetry to Optimize Over the Sherali-Adams Relaxation. 59-70 - Jianqiang Cheng, Céline Gicquel, Abdel Lisser:
A Second-Order Cone Programming Approximation to Joint Chance-Constrained Linear Programs. 71-80 - Agnès Gorge, Abdel Lisser, Riadh Zorgati:
Semidefinite Relaxations for Mixed 0-1 Second-Order Cone Program. 81-92 - Pierre Fouilhoux, Aurélien Questel:
The Non-Disjoint m-Ring-Star Problem: Polyhedral Results and SDH/SONET Network Design. 93-104 - Sylvie Borne, Roland Grappe, Mathieu Lacroix:
The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks. 105-116 - Mathieu Lacroix, Ali Ridha Mahjoub, Sébastien Martin:
Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem. 117-128 - Yuri Faenza, Samuel Fiorini, Roland Grappe, Hans Raj Tiwary:
Extended Formulations, Nonnegative Factorizations, and Randomized Communication Protocols. 129-140 - Gábor Braun, Sebastian Pokutta:
An Algebraic Approach to Symmetric Extended Formulations. 141-152 - Satoru Fujishige, Jens Maßberg:
Dual Consistent Systems of Linear Inequalities and Cardinality Constrained Polytopes. 153-164 - Alexandre S. Freire, Vicente Acuña, Pilu Crescenzi, Carlos Eduardo Ferreira, Vincent Lacroix, Paulo Vieira Milreu, Eduardo Moreno, Marie-France Sagot:
Minimum Ratio Cover of Matrix Columns by Extreme Rays of Its Induced Cone. 165-177 - Laura Galli, Konstantinos Kaparis, Adam N. Letchford:
Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm. 178-188 - Trivikram Dokka, Ioannis Mourtos, Frits C. R. Spieksma:
Fast Separation Algorithms for Three-Index Assignment Problems. 189-200 - Luis Eduardo Neves Gouveia, Markus Leitner, Ivana Ljubic:
On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes. 201-212 - Marie-Emilie Voge, François Clautiaux:
Theoretical Investigation of Aggregation in Pseudo-polynomial Network-Flow Models. 213-224 - Mario Ruthmair, Günther R. Raidl:
On Solving the Rooted Delay- and Delay-Variation-Constrained Steiner Tree Problem. 225-236 - Leonardo Conegundes Martinez, Alexandre Salles da Cunha:
A Parallel Lagrangian Relaxation Algorithm for the Min-Degree Constrained Minimum Spanning Tree Problem. 237-248 - Agostinho Agra, Marielle Christiansen, Rosa M. V. Figueiredo, Lars Magnus Hvattum, Michael Poss, Cristina Requejo:
Layered Formulation for the Robust Vehicle Routing Problem with Time Windows. 249-260 - Eduardo Álvarez-Miranda, Valentina Cacchiani, Tim Dorneth, Michael Jünger, Frauke Liers, Andrea Lodi, Tiziano Parriani, Daniel R. Schmidt:
Models and Algorithms for Robust Network Design with Several Traffic Scenarios. 261-272 - Fabio Furini, Carlo Alfredo Persiani, Paolo Toth:
Aircraft Sequencing Problems via a Rolling Horizon Algorithm. 273-284 - Pierre Bonami, Viet Hung Nguyen, Michel Klein, Michel Minoux:
On the Solution of a Graph Partitioning Problem under Capacity Constraints. 285-296 - Rémi Watrigant, Marin Bougeret, Rodolphe Giroudeau, Jean-Claude König:
Sum-Max Graph Partitioning Problem. 297-308 - Gabriela R. Argiroffo, Graciela L. Nasini, Pablo Daniel Torres:
The Packing Coloring Problem for (q, q-4) Graphs. 309-319 - Marc Demange, Jérôme Monnot, Petrica C. Pop, Bernard Ries:
Selective Graph Coloring in Some Special Classes of Graphs. 320-331 - Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirotaka Ono:
Graph Orientations Optimizing the Number of Light or Heavy Vertices. 332-343 - Monaldo Mastrolilli, Georgios Stamoulis:
Constrained Matching Problems in Bipartite Graphs. 344-355 - Monique Laurent, Antonios Varvitsiotis:
The Gram Dimension of a Graph. 356-367 - Manuel Sorge, Hannes Moser, Rolf Niedermeier, Mathias Weller:
Exploiting a Hypergraph Model for Finding Golomb Rulers. 368-379 - Tommy Färnqvist:
Counting Homomorphisms via Hypergraph-Based Structural Restrictions. 380-391 - Dennis Weyland, Roberto Montemanni, Luca Maria Gambardella:
Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines. 392-403 - Sophie Toulouse:
Differential Approximation of the Multiple Stacks TSP. 404-415 - Bo Xiong, Christine Chung:
Completion Time Scheduling and the WSRPT Algorithm. 416-426 - Mikhail Y. Kovalyov, Ammar Oulamara, Ameur Soukhal:
Two-Agent Scheduling on an Unbounded Serial Batching Machine. 427-438 - Cristina G. Fernandes, Rafael Crivellari Saliba Schouery:
Second-Price Ad Auctions with Binary Bids and Markets with Good Competition. 439-450 - Anna Huber, Vladimir Kolmogorov:
Towards Minimizing k-Submodular Functions. 451-462 - Konstantinos Papalamprou, Leonidas S. Pitsoulis:
Recognition Algorithms for Binary Signed-Graphic Matroids. 463-474
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-29 00:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
