Pages that link to "Item:Q1290171"
From MaRDI portal
The following pages link to Exact solution of bin-packing problems using column generation and branch-and-bound (Q1290171):
Displayed 50 items.
- Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem (Q271978) (← links)
- Integer linear programming models for the skiving stock problem (Q322686) (← links)
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- Skewed general variable neighborhood search for the location routing scheduling problem (Q337608) (← links)
- Vector bin packing with heterogeneous bins: application to the machine reassignment problem (Q338869) (← links)
- Solution approaches for the cutting stock problem with setup cost (Q339571) (← links)
- Bin packing and related problems: general arc-flow formulation with graph compression (Q342316) (← links)
- Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing (Q342540) (← links)
- An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling (Q342571) (← links)
- Column generation for extended formulations (Q458128) (← links)
- Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem (Q531429) (← links)
- Branching in branch-and-price: A generic scheme (Q652288) (← links)
- The maximum \(k\)-colorable subgraph problem and orbitopes (Q666000) (← links)
- Classification and literature review of integrated lot-sizing and cutting stock problems (Q724044) (← links)
- Algorithms for the one-dimensional two-stage cutting stock problem (Q724047) (← links)
- Stabilized branch-and-price algorithms for vector packing problems (Q724108) (← links)
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190) (← links)
- On compact formulations for integer programs solved by column generation (Q817199) (← links)
- Arcs-states models for the vehicle routing problem with time windows and related problems (Q856684) (← links)
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem (Q941555) (← links)
- A note on the minimum bounded edge-partition of a tree (Q967344) (← links)
- Column generation decomposition with the degenerate constraints in the subproblem (Q992573) (← links)
- Two heuristics for the one-dimensional bin-packing problem (Q1018262) (← links)
- New lower bounds based on column generation and constraint programming for the pattern minimization problem (Q1025240) (← links)
- 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← links)
- The one-dimensional cutting stock problem with due dates (Q1038325) (← links)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
- Logic based Benders' decomposition for orthogonal stock cutting problems (Q1652086) (← links)
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem (Q1662642) (← links)
- Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines (Q1711446) (← links)
- BPPLIB: a library for bin packing and cutting stock problems (Q1746064) (← links)
- Layout optimisation for an installation port of an offshore wind farm (Q1751774) (← links)
- A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function (Q1753400) (← links)
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems (Q1754107) (← links)
- Large multiple neighborhood search for the clustered vehicle-routing problem (Q1754733) (← links)
- Lower bounds for a bin packing problem with linear usage cost (Q1755229) (← links)
- Mathematical models and decomposition methods for the multiple knapsack problem (Q1755383) (← links)
- LP models for bin packing and cutting stock problems (Q1847189) (← links)
- Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths (Q1847195) (← links)
- Ranking lower bounds for the bin-packing problem (Q1887861) (← links)
- Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation (Q2001201) (← links)
- Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost (Q2003581) (← links)
- Characterizing the optimality gap and the optimal packings for the bin packing problem (Q2017826) (← links)
- Bin packing problem with conflicts and item fragmentation (Q2026980) (← links)
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization (Q2029254) (← links)
- New exact techniques applied to a class of network flow formulations (Q2061874) (← links)
- Column generation extensions of set covering greedy heuristics (Q2102849) (← links)
- A residual recombination heuristic for one-dimensional cutting stock problems (Q2121621) (← links)
- An introduction to stochastic bin packing-based server consolidation with conflicts (Q2146367) (← links)