Pages that link to "Item:Q4530667"
From MaRDI portal
The following pages link to Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem (Q4530667):
Displaying 50 items.
- Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem (Q271978) (← links)
- Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges (Q296762) (← links)
- Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost (Q319143) (← links)
- A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes (Q319637) (← links)
- Using the primal-dual interior point algorithm within the branch-price-and-cut method (Q336429) (← links)
- Solution approaches for the cutting stock problem with setup cost (Q339571) (← links)
- Cutting stock with no three parts per pattern: work-in-process and pattern minimization (Q429692) (← links)
- On the extremality of maximal dual feasible functions (Q433834) (← links)
- Using dual feasible functions to construct fast lower bounds for routing and location problems (Q499343) (← links)
- A survey of dual-feasible and superadditive functions (Q610986) (← links)
- Branching in branch-and-price: A generic scheme (Q652288) (← links)
- Classification and literature review of integrated lot-sizing and cutting stock problems (Q724044) (← links)
- On compact formulations for integer programs solved by column generation (Q817199) (← links)
- Enforcing minimum run length in the cutting stock problem (Q817568) (← links)
- In situ column generation for a cutting-stock problem (Q868997) (← links)
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem (Q941555) (← links)
- Nonlinear cutting stock problem model to minimize the number of different patterns and objects (Q959473) (← links)
- Theoretical investigations on maximal dual feasible functions (Q974987) (← links)
- New lower bounds based on column generation and constraint programming for the pattern minimization problem (Q1025240) (← links)
- An effective solution for a real cutting stock problem in manufacturing plastic rolls (Q1026560) (← links)
- An integrated approach to the one-dimensional cutting stock problem in coronary stent manufacturing (Q1027566) (← links)
- Strips minimization in two-dimensional cutting stock of circular items (Q1040959) (← links)
- Setup minimising conditions in the trim loss problem (Q1278430) (← links)
- Combined cutting stock and lot-sizing problem with pattern setup (Q1652627) (← links)
- A heuristic approach to minimize the number of saw cycles in small-scale furniture factories (Q1686524) (← links)
- One-dimensional cutting stock problem to minimize the number of different patterns (Q1869576) (← links)
- Worst-case analysis of maximal dual feasible functions (Q1926616) (← links)
- Pattern minimisation in cutting stock problems (Q1961237) (← links)
- Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost (Q2003581) (← links)
- Dual-feasible functions for integer programming and combinatorial optimization: algorithms, characterizations, and approximations (Q2064286) (← links)
- Dynamic-programming-based heuristic for multi-objective operating theater planning (Q2076419) (← links)
- Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost (Q2168751) (← links)
- Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost (Q2171594) (← links)
- Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation (Q2184147) (← links)
- On the facet defining inequalities of the mixed-integer bilinear covering set (Q2216198) (← links)
- Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria (Q2283297) (← links)
- Structure and interpretation of dual-feasible functions (Q2413164) (← links)
- Facets of a mixed-integer bilinear covering set with bounds on variables (Q2423814) (← links)
- Simultaneously determining the mix of space launch vehicles and the assignment of satellites to rockets (Q2488902) (← links)
- A hybrid heuristic to reduce the number of different patterns in cutting stock problems (Q2489315) (← links)
- One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming (Q2506214) (← links)
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting (Q2576248) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- Alternative configurations for cutting machines in a tube cutting mill (Q2643969) (← links)
- One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model (Q2803255) (← links)
- Setup and open-stacks minimization in one-dimensional stock cutting (Q2892308) (← links)
- Combinatorial complexity of a certain 1-dimensional cutting stock problem (Q2900934) (← links)
- On LP relaxations for the pattern minimization problem (Q3008919) (← links)
- C-Sets-based sequential heuristic procedure for the one-dimensional cutting stock problem with pattern reduction (Q3093039) (← links)
- Solving a bi-criterion cutting stock problem with open-ended demand: a case study (Q3156669) (← links)
