| 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 |
| 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 |
| 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 |
| Speed-Robust Scheduling: Sand, Bricks, and Rocks
|
2021 |
Eberle, Franziska |
Tag hinzufügen