The following pages link to Matthias Walter (Q896291):
Displayed 24 items.
- Simple extensions of polytopes (Q896292) (← links)
- Minimizing average project team size given multi-skilled workers with heterogeneous skill levels (Q1651635) (← links)
- Subgraph polytopes and independence polytopes of count matroids (Q1785403) (← links)
- On a cardinality-constrained transportation problem with market choice (Q1785735) (← links)
- Implementation of a unimodularity test (Q1947200) (← links)
- The graphical traveling salesperson problem has no integer programming formulation in the original space (Q2060618) (← links)
- Face dimensions of general-purpose cutting planes for mixed-integer linear programs (Q2061900) (← links)
- Persistency of linear programming relaxations for the stable set problem (Q2118136) (← links)
- Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization (Q2164692) (← links)
- Parity polytopes and binarization (Q2283103) (← links)
- Extended formulations for radial cones (Q2294359) (← links)
- A polyhedral study for the cubic formulation of the unconstrained traveling tournament problem (Q2684046) (← links)
- A heuristic approach to project staffing (Q2883648) (← links)
- Persistency of Linear Programming Relaxations for the Stable Set Problem (Q5041757) (← links)
- Sparsity of Lift-and-Project Cutting Planes (Q5171772) (← links)
- On a multi-project staffing problem with heterogeneously skilled workers (Q5176354) (← links)
- Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs (Q5232142) (← links)
- Exact price of anarchy for weighted congestion games with two players (Q6166899) (← links)
- Recognizing Series-Parallel Matrices in Linear Time (Q6200118) (← links)
- A Note on Matchings Constructed during Edmonds' Weighted Perfect Matching Algorithm (Q6284877) (← links)
- The Almost-Disjoint 2-Path Decomposition Problem (Q6321899) (← links)
- Integrality of Linearizations of Polynomials over Binary Variables using Additional Monomials (Q6329275) (← links)
- A Polyhedral Study for the Cubic Formulation of the Unconstrained Traveling Tournament Problem (Q6354011) (← links)
- The Graphical Traveling Salesperson Problem has no Integer Programming Formulation in the Original Space (Q6370663) (← links)