Implementing Automatic Benders Decomposition in a Modern MIP Solver

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IPCO (21. : 2020 : London) Integer programming and combinatorial optimization
1. Verfasser: Salvagnin,, Pierre Bonami, Domenico (VerfasserIn)
Weitere Verfasser: Tramontani, Andrea (VerfasserIn)
Format: UnknownFormat
Sprache:eng
Veröffentlicht: 2020
Schlagworte:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Titel Jahr Verfasser
Idealness of k-wise Intersecting Families . 2020 Huynh,, Ahmad Abdi, Gérard Cornuéjols, Tony
Implementing Automatic Benders Decomposition in a Modern MIP Solver 2020 Salvagnin,, Pierre Bonami, Domenico
Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation 2020 Kumar,, Naveen Garg, Nikhil
A Combinatorial Algorithm for Computing the Rank of a Generic Partitioned Matrix with 2 x 2 Submatrices 2020 Hirai, Hiroshi
Persistency of Linear Programming Relaxations for the Stable Set Problem 2020 Walter,, Elisabeth Rodríguez-Heck, Karl Stickler, Matthias
Sequence Independent Lifting for the Set of Submodular Maximization Problem 2020 Prokopyev,, Xueyu Shi, Oleg A.
Optimizing Sparsity over Lattices and Semigroups 2020 Loera,, Iskander Aliev, Gennadiy Averkov, Jesus A. De
Tight Approximation Bounds for Maximum Multi-coverage 2020 Ghoshal,, Siddharth Barman, Omar Fawzi, Suprovat
Fair Colorful k-Center Clustering 2020 Sheth,, Xinrui Jia, Kshiteej
Recognizing Even-Cycle and Even-Cut Matroids 2020 Heo, Cheolwon
Popular Branchings and Their Dual Certificates 2020 Schlotter,, Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó
Sparse Graphs and an Augmentation Problem 2020 Király, Csaba
Packing Under Convex Quadratic Constraints . . 2020 Raber,, Max Klimm, Marc E. Pfetsch, Rico
On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming 2020 Lodi,, Benjamin Müller, Gonzalo Muñoz, Maxime Gasse, Ambros Gleixner, Andrea
Flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-Connectivity. 2020 Hommelsheim,, David Adjiashvili, Felix
Improved Approximation Algorithms for Inventory Problems 2020 Bosman, Thomas
Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles 2020 Huynh,, Michele Conforti, Samuel Fiorini, Tony
Algorithms for Flows over Time with Scheduling Costs 2020 Frascaria, Dario
Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract). 2020 Nagarajan,, Anupam Gupta, Amit Kumar, Viswanath
About the Complexity of Two-Stage Stochastic IPs 2020 Klein, Kim-Manuel
Alle Artikel auflisten