Pages that link to "Item:Q6102323"
From MaRDI portal
The following pages link to 0/1-Integer programming: Optimization and Augmentation are equivalent (Q6102323):
Displaying 14 items.
- Non-standard approaches to integer programming (Q697562) (← links)
- Solving MIPs via scaling-based augmentation (Q1662107) (← links)
- Integral simplex using decomposition with primal cutting planes (Q1683694) (← links)
- Dynamic penalization of fractional directions in the integral simplex using decomposition: application to aircrew scheduling (Q1694842) (← links)
- Short simplex paths in lattice polytopes (Q2117352) (← links)
- A scaling algorithm for optimizing arbitrary functions over vertices of polytopes (Q2235141) (← links)
- Graver basis and proximity techniques for block-structured separable convex integer minimization problems (Q2248743) (← links)
- Extended formulations for radial cones (Q2294359) (← links)
- Integer Programming: Optimization and Evaluation Are Equivalent (Q3183481) (← links)
- Test sets and inequalities for integer programs (Q4645910) (← links)
- (Q5381125) (← links)
- A Generalized Simplex Method for Integer Problems Given by Verification Oracles (Q5853568) (← links)
- Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization (Q5867626) (← links)
- The complexity of geometric scaling (Q6556153) (← links)
