The following pages link to (Q3939599):
Displaying 18 items.
- On N. Z. Shor's three scientific ideas (Q380646) (← links)
- The max-cut problem on graphs not contractible to \(K_ 5\) (Q593988) (← links)
- Large-scale 0-1 linear programming on distributed workstations (Q750295) (← links)
- A spectral approach to polyhedral dimension (Q750306) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- Canonical equation sets for classes of concordant polytopes (Q811401) (← links)
- Polyhedral results for a vehicle routing problem (Q1176821) (← links)
- A spectral method for concordant polyhedral faces (Q1180392) (← links)
- An analytical comparison of different formulations of the travelling salesman problem (Q1181739) (← links)
- A cutting plane algorithm for the windy postman problem (Q1198736) (← links)
- Structure of a simple scheduling polyhedron (Q1803611) (← links)
- Unique representation in convex sets by extraction of marked components (Q1837113) (← links)
- Facets of the \(k\)-partition polytope (Q1897366) (← links)
- The equipartition polytope. I: Formulations, dimension and basic facets (Q2639779) (← links)
- A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds (Q3336583) (← links)
- On box totally dual integral polyhedra (Q3717741) (← links)
- An algorithmic proof of the polyhedral decomposition theorem (Q3802881) (← links)
- Activity propagation in systems of linear inequalities and its relation to block-coordinate descent in linear programs (Q6049435) (← links)
