The following pages link to Matthias Walter (Q896291):
Displaying 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)
- Recognizing Series-Parallel Matrices in Linear Time (Q6200118) (← links)
- Optimal subgraphs in geometric scale-free random graphs (Q6531746) (← links)
- Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization (Q6589749) (← links)
- Short paper -- The binary linearization complexity of pseudo-Boolean functions (Q6633276) (← links)
- Algorithmic solutions for maximizing shareable costs (Q6659082) (← links)
- A Row-wise Algorithm for Graph Realization (Q6741451) (← links)
- State-of-the-art Methods for Pseudo-Boolean Solving with SCIP (Q6761231) (← links)
