default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISCO 2016: Vietri sul Mare, Italy
- Raffaele Cerulli, Satoru Fujishige, Ali Ridha Mahjoub:
Combinatorial Optimization - 4th International Symposium, ISCO 2016, Vietri sul Mare, Italy, May 16-18, 2016, Revised Selected Papers. Lecture Notes in Computer Science 9849, Springer 2016, ISBN 978-3-319-45586-0 - Lucas Assunção, Andréa Cynthia Santos
, Thiago F. Noronha, Rafael Andrade:
On the Finite Optimal Convergence of Logic-Based Benders' Decomposition in Solving 0-1 Min-Max Regret Optimization Problems with Interval Costs. 1-12 - Walid Ben-Ameur, Antoine Glorieux, José Neto:
A Full Description of Polytopes Related to the Index of the Lowest Nonzero Row of an Assignment Matrix. 13-25 - Stefano Coniglio, Arie Koster, Nils Spiekermann:
On Robust Lot Sizing Problems with Storage Deterioration, with Applications to Heat and Power Cogeneration. 26-37 - Daniël Paulusma, Christophe Picouleau, Bernard Ries:
Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions. 38-49 - Hiroshi Nishiyama, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
The Parity Hamiltonian Cycle Problem in Directed Graphs. 50-58 - Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Annegret Wagler:
Lovász-Schrijver PSD-Operator on Claw-Free Graphs. 59-70 - Sara Mattia:
Benders Decomposition for Capacitated Network Design. 71-80 - Cristiano Arbex Valle, John E. Beasley, Alexandre Salles da Cunha:
Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories. 81-97 - Tobias Harks, Veerle Timmermans:
Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games. 98-109 - Christoph Buchheim, Maribel Montenegro, Angelika Wiegele:
A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs. 110-122 - Filippo Focacci, Fabio Furini, Virginie Gabrel, Daniel Godard, Xueying Shen:
MIP Formulations for a Rich Real-World Lot-Sizing Problem with Setup Carryover. 123-134 - Fabio D'Andreagiovanni, Ambros M. Gleixner:
Towards an Accurate Solution of Wireless Network Design Problems. 135-147 - Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau:
Approximability and Exact Resolution of the Multidimensional Binary Vector Assignment Problem. 148-159 - Valeria A. Leoni, Maria Patricia Dobson:
Towards a Polynomial Equivalence Between k -Packing Functions and k-Limited Packings in Graphs. 160-165 - Lucas Létocart, Angelika Wiegele:
Exact Solution Methods for the k-Item Quadratic Knapsack Problem. 166-176 - Manuel Aprile, Alfonso Cevallos, Yuri Faenza:
On Vertices and Facets of Combinatorial 2-Level Polytopes. 177-188 - Corinna Gottschalk, Hendrik Lüthen, Britta Peis, Andreas Wierz:
Optimization Problems with Color-Induced Budget Constraints. 189-200 - Adam N. Letchford, Francesca Marzi, Fabrizio Rossi, Stefano Smriglio:
Strengthening Chvátal-Gomory Cuts for the Stable Set Problem. 201-212 - Oliver G. Czibula, Hanyu Gu, Yakov Zinder:
Scheduling Personnel Retraining: Column Generation Heuristics. 213-224 - Gustavo Dias, Leo Liberti:
Diagonally Dominant Programming in Distance Geometry. 225-236 - Borzou Rostami, Christopher Strothmann, Christoph Buchheim:
A Decomposition Approach for Single Allocation Hub Location Problems with Multiple Capacity Levels. 237-248 - Kazutoshi Ando, Koki Sato:
An Algorithm for Finding a Representation of a Subtree Distance. 249-259 - Michele Barbato, Roland Grappe, Mathieu Lacroix, Roberto Wolfler Calvo:
A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks. 260-272 - Marika Ivanová:
Shared Multicast Trees in Ad Hoc Wireless Networks. 273-284 - Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia:
Two-Level Polytopes with a Prescribed Facet. 285-296 - Claudio Arbib, Giovanni Felici, Mara Servilio, Paolo Ventura:
Optimum Solution of the Closest String Problem via Rank Distance. 297-307 - Mohammed-Albarra Hassan Abdel-Jabbar, Imed Kacem, Sébastien Martin, Izzeldin M. Osman:
Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut. 308-319 - Youcef Magnouche, Sébastien Martin:
The Multi-terminal Vertex Separator Problem: Polytope Characterization and TDI-ness. 320-331 - Matthias Köppe, Yuan Zhou:
Toward Computer-Assisted Discovery and Automated Proofs of Cutting Plane Theorems. 332-344 - Katerina Böhmová, Enrico Kravina, Matús Mihalák:
Approximating Interval Selection on Unrelated Machines with Unit-Length Intervals and Cores. 345-356 - Diego Recalde, Daniel E. Severín, Ramiro Torres, Polo Vaca:
Balanced Partition of a Graph for Football Team Realignment in Ecuador. 357-368 - Yuni Iwamasa:
On a General Framework for Network Representability in Discrete Optimization - (Extended Abstract). 369-380 - Hiroshi Hirai, Taihei Oki:
A Compact Representation for Minimizers of k-Submodular Functions (Extended Abstract). 381-392 - Susumu Morito, Yuho Takehi, Jun Imaizumi, Takayuki Shiina:
Optimization Models for Multi-period Railway Rolling Stock Assignment. 393-402 - Adam Kurpisz, Samuli Leppänen, Monaldo Mastrolilli:
Sum-of-Squares Rank Upper Bounds for Matching Problems. 403-413 - Maximilian John, Andreas Karrenbauer:
A Novel SDP Relaxation for the Quadratic Assignment Problem Using Cut Pseudo Bases. 414-425 - Dimitri Watel, Pierre-Louis Poirion:
The Maximum Matrix Contraction Problem. 426-438 - Azeddine Cheref, Christian Artigues, Jean-Charles Billaut, Sandra Ulrich Ngueveu:
Integrated Production Scheduling and Delivery Routing: Complexity Results and Column Generation. 439-450
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-03-27 23:19 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:
