Pages that link to "Item:Q1363415"
From MaRDI portal
The following pages link to A cutting plane approach to capacitated lot-sizing with start-up costs (Q1363415):
Displaying 33 items.
- The single-item lot-sizing polytope with continuous start-up costs and uniform production capacity (Q256627) (← links)
- A polyhedral study of production ramping (Q304233) (← links)
- On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay (Q342563) (← links)
- A polyhedral study of lot-sizing with supplier selection (Q448963) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times (Q706984) (← links)
- On a fix-and-relax framework for a class of project scheduling problems (Q817205) (← links)
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
- A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times (Q954053) (← links)
- A heuristic approach for big bucket multi-level production planning problems (Q958084) (← links)
- Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution (Q967369) (← links)
- Valid inequalities and separation for capacitated economic lot sizing (Q1108195) (← links)
- MIP modelling of changeovers in production planning and scheduling problems (Q1278814) (← links)
- Progress with single-item lot-sizing (Q1390225) (← links)
- On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra (Q1580978) (← links)
- Optimal planning in large multi-site production networks (Q1584799) (← links)
- A polyhedral approach to a production planning problem (Q1593522) (← links)
- Partial objective inequalities for the multi-item capacitated lot-sizing problem (Q1652548) (← links)
- Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
- A computational analysis of lower bounds for big bucket production planning problems (Q1935570) (← links)
- Budget-cut: introduction to a budget based cutting-plane algorithm for capacity expansion models (Q2136875) (← links)
- A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing (Q2248555) (← links)
- A cross entropy algorithm for the Knapsack problem with setups (Q2384601) (← links)
- Multi-item dynamic production-distribution planning in process industries with divergent finishing stages (Q2496061) (← links)
- A maritime inventory routing problem: discrete time formulations and valid inequalities (Q2811316) (← links)
- A polyhedral study of the single-item lot-sizing problem with continuous start-up costs (Q2840719) (← links)
- Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (Q2960369) (← links)
- LS-LIB: A Library of Tools for Solving Production Planning Problems (Q2971615) (← links)
- An Outer Approximation Algorithm for Capacitated Disassembly Scheduling Problem with Parts Commonality and Random Demand (Q3296385) (← links)
- Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes (Q3351124) (← links)
- A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs (Q3489777) (← links)
- Valid Inequalities for the Lasdon-Terjung Production Model (Q4018532) (← links)
- Predictive Search for Capacitated Multi-Item Lot Sizing Problems (Q5084658) (← links)
