Pages that link to "Item:Q4883167"
From MaRDI portal
The following pages link to Convex envelope results and strong formulations for a class of mixed-integer programs (Q4883167):
Displaying 6 items.
- Exact and heuristic solution approaches for the mixed integer setup knapsack problem (Q928018) (← links)
- A comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand (Q949496) (← links)
- Using convex envelopes to solve the interactive fixed-charge linear programming problem (Q1093525) (← links)
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
- A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems (Q3114873) (← links)
- More on ‘Models and algorithms for the dynamic-demand joint replenishment problem’ (Q5478823) (← links)