| 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 |
| 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 |
| Complexity, Exactness, and Rationality in Polynomial Optimization
|
2021 |
Bienstock, Daniel |
| Affinely Representable Lattices, Stable Matchings, and Choice Functions
|
2021 |
Faenza, Yuri |
| Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets
|
2021 |
Pia, Alberto Del |
| On the Power of Static Assignment Policies for Robust Facility Location Problems
|
2021 |
Housni, Omar EI |
| Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators
|
2021 |
Naves, Guyslain |
| A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows
|
2021 |
Graf, Lukas |
| Lifting Convex Inequalities for Bipartite Bilinear Programs
|
2021 |
Gu, Xiaoyi |
| A Computational Status Update for Exact Rational Mixed Integer Programming
|
2021 |
Eifler, Leon |
Tag hinzufügen