Pages that link to "Item:Q2640444"
From MaRDI portal
The following pages link to On the equivalence between some discrete and continuous optimization problems (Q2640444):
Displaying 10 items.
- Edge-directions of standard polyhedra with applications to network flows (Q811875) (← links)
- Zonotopes and the LP-Newton method (Q833464) (← links)
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability (Q930342) (← links)
- Existence and sum decomposition of vertex polyhedral convex envelopes (Q941026) (← links)
- A clique algorithm for standard quadratic programming (Q955308) (← links)
- Optimality conditions for maximizing a function over a polyhedron (Q2248749) (← links)
- The use of edge-directions and linear programming to enumerate vertices (Q2471066) (← links)
- Continuous quadratic programming formulations of optimization problems on graphs (Q2629636) (← links)
- Reductions of approximate linear programs for network revenue management (Q2797458) (← links)
- The fundamental theorem of linear programming: extensions and applications (Q2996803) (← links)