The following pages link to Marc E. Pfetsch (Q284837):
Displayed 50 items.
- A polyhedral investigation of star colorings (Q284838) (← links)
- Orbitopal fixing (Q408377) (← links)
- An infeasible-point subgradient method using adaptive approximate projections (Q461434) (← links)
- The maximum \(k\)-colorable subgraph problem and orbitopes (Q666000) (← links)
- Competitive online multicommodity routing (Q839644) (← links)
- Item:Q284837 (redirect page) (← links)
- Packing and partitioning orbitopes (Q925263) (← links)
- Sparse approximate solution of partial differential equations (Q972312) (← links)
- On the maximum feasible subsystem problem, IISs and IIS-hypergraphs (Q1396834) (← links)
- Branch-and-cut for linear programs with overlapping SOS1 constraints (Q1646682) (← links)
- Solving MIPs via scaling-based augmentation (Q1662107) (← links)
- Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints (Q1728353) (← links)
- A computational comparison of symmetry handling methods for mixed integer programs (Q1741126) (← links)
- Complexity of minimum irreducible infeasible subsystem covers for flow networks (Q1752598) (← links)
- Models for fare planning in public transport (Q1759833) (← links)
- Computing the face lattice of a polytope from its vertex-facet incidences (Q1862131) (← links)
- Computing the bounded subcomplex of an unbounded polyhedron (Q1941218) (← links)
- Capacity evaluation for large-scale gas networks (Q2086294) (← links)
- Recovery under side constraints (Q2106480) (← links)
- Packing under convex quadratic constraints (Q2118134) (← links)
- Optimal patchings for consecutive ones matrices (Q2125569) (← links)
- Identification of model uncertainty via optimal design of experiments applied to a mechanical press (Q2138321) (← links)
- On the complexity of finding shortest variable disjunction branch-and-bound proofs (Q2164707) (← links)
- Sparse recovery with integrality constraints (Q2192094) (← links)
- Block-sparse recovery of semidefinite systems and generalized null space conditions (Q2197151) (← links)
- Sparsity of integer formulations for binary programs (Q2294334) (← links)
- On the structure of linear programs with overlapping cardinality constraints (Q2297664) (← links)
- Semi-automatically optimized calibration of internal combustion engines (Q2303522) (← links)
- Maximizing the storage capacity of gas networks: a global MINLP approach (Q2331362) (← links)
- Polytopes associated with symmetry handling (Q2414904) (← links)
- On the complexity of instationary gas flows (Q2417151) (← links)
- Irreducible infeasible subsystems of semidefinite systems (Q2420811) (← links)
- The Steiner connectivity problem (Q2434988) (← links)
- On the robustness of potential-based flow networks (Q2689822) (← links)
- Physics informed neural networks: a case study for gas transport problems (Q2699348) (← links)
- Vertex-facet incidences of unbounded polyhedra (Q2725173) (← links)
- (Q2761100) (← links)
- (Q2761103) (← links)
- (Q2917355) (← links)
- Validation of nominations in gas network optimization: models, methods, and solutions (Q2943808) (← links)
- Branch-Cut-and-Propagate for the Maximum k-Colorable Subgraph Problem with Symmetry (Q3003279) (← links)
- (Q3023951) (← links)
- (Q3416575) (← links)
- (Q3416594) (← links)
- Computing Optimal Discrete Morse Functions (Q3439152) (← links)
- (Q3525436) (← links)
- Branch-and-Cut for the Maximum Feasible Subsystem Problem (Q3608970) (← links)
- (Q4263701) (← links)
- (Q4418120) (← links)
- A Mixed-Integer Nonlinear Program for the Design of Gearboxes (Q4596462) (← links)