| Approximating the Discrete Time-Cost Tradeoff Problem with Bounded Depth
|
2021 |
Daboul, Siad |
| On the Implementation and Strengthening of Intersection Cuts for QCQPs
|
2021 |
Chmiela, Antonia |
| New Exact Techniques Applied to a Class of Network Flow Formulations
|
2021 |
Lima, Vinicius L. de |
| Robust k-Center with Two Types of Radii
|
2021 |
Chakrabarty, Deeparnab |
| The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs
|
2021 |
Jansen, Klaus |
| Computational Aspects of Relaxation Complexity
|
2021 |
Averkov, Gennadiy |
| Fixed Parameter Approximation Scheme for Min-Max k-Cut
|
2021 |
Chandrasekaran, Karthekeyan |
| Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization - II
|
2021 |
Basu, Amitabh |
| Proximity Bounds for Random Integer Programs
|
2021 |
Celaya, Marcel |
| On the Geometry of Symmetry Breaking Inequalities
|
2021 |
Verschae, José |
| A Combinatorial Algorithm for Computing the Degree of the Determinant of a Generic Partitioned Polynomial Matrix with 2 x 2 Submatrices
|
2021 |
Iwamasa, Yuni |
| Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems
|
2021 |
Matoya, Kazuki |
| On the Recognition of {a, b, c}-Modular Matrices
|
2021 |
Glanzer, Christoph |
| Semi-streaming Algorithms for Submodular Matroid Intersection
|
2021 |
Garg, Paritosh |
| A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem
|
2021 |
Aprile, Manuel |
| A New Integer Programming Formulation of the Graphical Traveling Salesman Problem
|
2021 |
Carr, Robert D. |
| Implications, Conflicts, and Reductions for Steiner Trees
|
2021 |
Rehfeldt, Daniel |
| Improving the Approximation Ratio for Capacitated Vehicle Routing
|
2021 |
Blauth, Jannis |
| Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual
|
2021 |
Buchbinder, Niv |
| Sum-of-Squares Hierarchies for Binary Polynomial Optimization
|
2021 |
Slot, Lucas |
Tag hinzufügen