Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts (Englisch)
- Neue Suche nach: McCormick,, Hassene Aissi, Thomas
- Neue Suche nach: Queyranne, Maurice
- Neue Suche nach: McCormick,, Hassene Aissi, Thomas
- Neue Suche nach: Queyranne, Maurice
In:
Integer programming and combinatorial optimization
; 27-39
;
2020
-
ISBN:
- Aufsatz (Konferenz) / Print
-
Titel:Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts
-
Beteiligte:McCormick,, Hassene Aissi, Thomas ( Autor:in ) / Queyranne, Maurice ( Autor:in )
-
Kongress:IPCO ; 21. ; 2020 ; London
-
Erschienen in:
-
Verlag:
- Neue Suche nach: Springer
-
Erscheinungsort:Cham
-
Erscheinungsdatum:2020
-
ISBN:
-
Medientyp:Aufsatz (Konferenz)
-
Format:Print
-
Sprache:Englisch
- Neue Suche nach: 54.10
- Weitere Informationen zu Basisklassifikation
-
Schlagwörter:
-
Klassifikation:
BKL: 54.10 Theoretische Informatik -
Datenquelle:
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
Idealness of k-wise Intersecting Families .Huynh,, Ahmad Abdi, Gérard Cornuéjols, Tony / Lee, Dabeen et al. | 2020
- 13
-
Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-Connectivity.Hommelsheim,, David Adjiashvili, Felix / Miihlenthaler, Moritz et al. | 2020
- 27
-
Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum CutsMcCormick,, Hassene Aissi, Thomas / Queyranne, Maurice et al. | 2020
- 40
-
Optimizing Sparsity over Lattices and SemigroupsLoera,, Iskander Aliev, Gennadiy Averkov, Jesus A. De / Oertel, Timm et al. | 2020
- 52
-
A. Technique for Obtaining True Approximations for k-Center with Covering ConstraintsKurpisz,, Georg Anegg, Haris Angelidakis, Adam / Zenklusen, Rico et al. | 2020
- 66
-
Tight Approximation Bounds for Maximum Multi-coverageGhoshal,, Siddharth Barman, Omar Fawzi, Suprovat / Gürpinar, Emirhan et al. | 2020
- 78
-
Implementing Automatic Benders Decomposition in a Modern MIP SolverSalvagnin,, Pierre Bonami, Domenico / Tramontani, Andrea et al. | 2020
- 91
-
Improved Approximation Algorithms for Inventory ProblemsBosman, Thomas / Olver, Neil et al. | 2020
- 104
-
Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd CyclesHuynh,, Michele Conforti, Samuel Fiorini, Tony / Weltge, Stefan et al. | 2020
- 117
-
On a Generalization of the Chvatal-Gomory ClosureGünlük,, Sanjeeb Dash, Oktay / Lee, Dabeen et al. | 2020
- 130
-
Algorithms for Flows over Time with Scheduling CostsFrascaria, Dario / Olver, Neil et al. | 2020
- 144
-
Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-ApproximationKumar,, Naveen Garg, Nikhil / Sebó, András et al. | 2020
- 158
-
Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract).Nagarajan,, Anupam Gupta, Amit Kumar, Viswanath / Shen, Xiangkun et al. | 2020
- 171
-
Continuous Facility Location on GraphsLendl,, Tim A. Hartmann, Stefan / Woeginger, Gerhard J. et al. | 2020
- 182
-
Recognizing Even-Cycle and Even-Cut MatroidsHeo, Cheolwon / Guenin, Bertrand et al. | 2020
- 196
-
A Combinatorial Algorithm for Computing the Rank of a Generic Partitioned Matrix with 2 x 2 SubmatricesHirai, Hiroshi / Iwamasa, Yuni et al. | 2020
- 209
-
Fair Colorful k-Center ClusteringSheth,, Xinrui Jia, Kshiteej / Svensson, Ola et al. | 2020
- 223
-
Popular Branchings and Their Dual CertificatesSchlotter,, Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó / Schmidt-Kraepelin, Ulrike et al. | 2020
- 238
-
Sparse Graphs and an Augmentation ProblemKirály, Csaba / Mihálykó, András et al. | 2020
- 252
-
About the Complexity of Two-Stage Stochastic IPsKlein, Kim-Manuel et al. | 2020
- 266
-
Packing Under Convex Quadratic Constraints . .Raber,, Max Klimm, Marc E. Pfetsch, Rico / Skutella, Martin et al. | 2020
- 280
-
Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden TrianglesKobayashi, Yusuke et al. | 2020
- 294
-
Single Source Unsplittable Flows with Arc-Wise Lower and Upper BoundsMorell, Sarah / Skutella, Martin et al. | 2020
- 307
-
Maximal Quadratic-Free SetsMufioz, Gonzalo / Serrano, Felipe et al. | 2020
- 322
-
On Generalized Surrogate Duality in Mixed-Integer Nonlinear ProgrammingLodi,, Benjamin Müller, Gonzalo Muñoz, Maxime Gasse, Ambros Gleixner, Andrea / Serrano, Felipe et al. | 2020
- 338
-
The Integrality Number of an Integer ProgramSchlöter,, Joseph Paat, Miriam / Weismantel, Robert et al. | 2020
- 351
-
Persistency of Linear Programming Relaxations for the Stable Set ProblemWalter,, Elisabeth Rodríguez-Heck, Karl Stickler, Matthias / Weltge, Stefan et al. | 2020
- 364
-
Construcüng Lattice-Free Gradient Polyhedra in Dimension TwoSchlóter,, Joseph Paat, Miriam / Speakman, Emily et al. | 2020
- 378
-
Sequence Independent Lifting for the Set of Submodular Maximization ProblemProkopyev,, Xueyu Shi, Oleg A. / Zeng, Bo et al. | 2020
- 391
-
A Fast (2+ 2/7)-Approximation Algorithm for Capacitated Cycle CoveringTraub, Vera / Trobst, Thorben et al. | 2020
- 405
-
Graph Coloring Lower Bounds from Decision DiagramsHoeve, Willem-Jan van et al. | 2020
- 419
-
On Convex Hulls of Epigraphs of QCQPsWang, Alex L. / Kiling-Karzan, Fatma et al. | 2020
- 433
-
On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables.Gomez,, Linchuan Wei, Andres / Kücükyavuz, Simge et al. | 2020