Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISCO 2022: Virtual Event
- Ivana Ljubic
, Francisco Barahona, Santanu S. Dey, Ali Ridha Mahjoub:
Combinatorial Optimization - 7th International Symposium, ISCO 2022, Virtual Event, May 18-20, 2022, Revised Selected Papers. Lecture Notes in Computer Science 13526, Springer 2022, ISBN 978-3-031-18529-8
Polyhedra and Algorithms
- Alberto Del Pia, Jeff T. Linderoth, Haoran Zhu:
New Classes of Facets for Complementarity Knapsack Problems. 3-21 - José Luis Figueroa González, Mourad Baïou, Alain Quilliot, Hélène Toussaint, Annegret Wagler:
Branch-and-Cut for a 2-Commodity Flow Relocation Model with Time Constraints. 22-34 - Ibrahima Diarrassouba, Youssouf Hadhbi:
The Constrained-Routing and Spectrum Assignment Problem: Valid Inequalities and Branch-and-Cut Algorithm. 35-47
Polyhedra and Combinatorics
- Sina Akbari, Adolfo R. Escobedo:
Top-k List Aggregation: Mathematical Formulations and Polyhedral Comparisons. 51-63 - Christoph Buchheim, Maja Hügging:
Bounded Variation in Binary Sequences. 64-75 - Reka Agnes Kovacs:
On Minimally Non-firm Binary Matrices. 76-88 - Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Few Induced Disjoint Paths for H-Free Graphs. 89-101 - Hans Raj Tiwary:
On Permuting Some Coordinates of Polytopes. 102-114
Non-linear Optimization
- Aloïs Duguet, Sandra Ulrich Ngueveu:
Piecewise Linearization of Bivariate Nonlinear Functions: Minimizing the Number of Pieces Under a Bounded Approximation Error. 117-129 - Marcia Fampa, Jon Lee:
An Outer-Approximation Algorithm for Maximum-Entropy Sampling. 130-142 - Prashant Palkar, Ashutosh Mahajan:
Mitigating Anomalies in Parallel Branch-and-Bound Based Algorithms for Mixed-Integer Nonlinear Optimization. 143-156
Game Theory
- Joran van den Bosse, Marc Uetz, Matthias Walter:
Exact Price of Anarchy for Weighted Congestion Games with Two Players. 159-171 - Minh Hieu Nguyen, Mourad Baïou, Viet Hung Nguyen:
Nash Balanced Assignment Problem. 172-186
Graphs and Trees
- Flavia Bonomo-Braberman, Eric Brandwein, Carolina Lucía Gonzalez, Agustín Sansone:
On the Thinness of Trees. 189-200 - Ro-Yu Wu, Cheng-Chia Tseng, Ling-Ju Hung, Jou-Ming Chang:
Generating Spanning-Tree Sequences of a Fan Graph in Lexicographic Order and Ranking/Unranking Algorithms. 201-211
Cutting and Packing
- Andrew Bloch-Hansen, Roberto Solis-Oba, Andy Yu:
High Multiplicity Strip Packing with Three Rectangle Types. 215-227 - Guillaume Sagnol, Daniel Schmidt genannt Waldschmidt:
Improved Bounds for Stochastic Extensible Bin Packing Under Distributional Assumptions. 228-241
Applications
- Tabea Brandt, Christina Büsing, Sigrid Knust:
One Transfer per Patient Suffices: Structural Insights About Patient-to-Room Assignment. 245-259 - Manuel Iori, Alberto Locatelli, Marco Locatelli, Juan José Salazar González:
Tool Switching Problems in the Context of Overlay Printing with Multiple Colours. 260-271 - Jenny Segschneider, Arie M. C. A. Koster:
Optimal Vaccination Strategies for Multiple Dose Vaccinations. 272-283
Approximation Algorithms
- Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno:
Pervasive Domination. 287-298 - Yann Disser, David Weckbecker:
Unified Greedy Approximability Beyond Submodular Maximization. 299-311 - Kei Kimura, Kotaro Nakayama:
Neighborhood Persistency of the Linear Optimization Relaxation of Integer Linear Optimization. 312-323 - Yusuke Saito, Akiyoshi Shioura:
Polynomial-Time Approximation Schemes for a Class of Integrated Network Design and Scheduling Problems with Parallel Identical Machines. 324-335
a service of 
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 2024-06-10 21:37 CEST 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:
