Pages that link to "Item:Q1093525"
From MaRDI portal
The following pages link to Using convex envelopes to solve the interactive fixed-charge linear programming problem (Q1093525):
Displayed 8 items.
- Existence and sum decomposition of vertex polyhedral convex envelopes (Q941026) (← links)
- A discrete dynamic convexized method for nonlinear integer programming (Q953398) (← links)
- A new simplicial cover technique in constrained global optimization (Q1187367) (← links)
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
- (Q3200886) (← links)
- (Q3494393) (← links)
- Multiproduct dynamic lot-sizing model with coordinated replenishments (Q3778511) (← links)
- (Q4287998) (← links)