Pages that link to "Item:Q1847189"
From MaRDI portal
The following pages link to LP models for bin packing and cutting stock problems (Q1847189):
Displaying 50 items.
- Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem (Q271978) (← links)
- A hybrid heuristic algorithm for the 2D variable-sized bin packing problem (Q296697) (← links)
- A single machine scheduling problem with two-dimensional vector packing constraints (Q319018) (← links)
- Procedures for the bin packing problem with precedence constraints (Q322561) (← 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)
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size (Q336416) (← links)
- Mathematical programming algorithms for bin packing problems with item fragmentation (Q336982) (← links)
- Skewed general variable neighborhood search for the location routing scheduling problem (Q337608) (← 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)
- Exactly solving packing problems with fragmentation (Q342536) (← links)
- Lower and upper bounds for the bin packing problem with fragile objects (Q406499) (← links)
- The proper relaxation and the proper gap of the skiving stock problem (Q510433) (← links)
- Numerical optimization method for packing regular convex polygons (Q519665) (← links)
- Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem (Q531429) (← 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)
- The layout problem of two kinds of graph elements with performance constraints and its optimality conditions (Q815991) (← links)
- On compact formulations for integer programs solved by column generation (Q817199) (← links)
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem (Q941555) (← links)
- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths (Q1001001) (← links)
- Complementary column generation and bounding approaches for set partitioning formulations (Q1001332) (← links)
- 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← links)
- An effective solution for a real cutting stock problem in manufacturing plastic rolls (Q1026560) (← links)
- The one-dimensional cutting stock problem with due dates (Q1038325) (← links)
- A memetic algorithm for the cost-oriented robotic assembly line balancing problem (Q1654375) (← links)
- Exact algorithms for the bin packing problem with fragile objects (Q1662100) (← links)
- The skiving stock problem and its relation to hypergraph matchings (Q1662646) (← links)
- Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines (Q1711446) (← links)
- Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case (Q1730578) (← links)
- BPPLIB: a library for bin packing and cutting stock problems (Q1746064) (← links)
- Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints (Q1751662) (← links)
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems (Q1754107) (← links)
- A cutting stock problem and its solution in the manufacturing industry of large electric generators (Q1777147) (← links)
- A combined approach to the solution to the general one-dimensional cutting stock problem (Q1777156) (← links)
- Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation (Q2001201) (← links)
- Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem (Q2003574) (← links)
- Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost (Q2003581) (← links)
- An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case (Q2012070) (← links)
- Characterizing the optimality gap and the optimal packings for the bin packing problem (Q2017826) (← links)
- Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches (Q2027058) (← links)
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- Queue-constrained packing: a vehicle ferry case study (Q2029061) (← links)
- Scalable optimal deployment in the cloud of component-based applications using optimization modulo theory, mathematical programming and symmetry breaking (Q2043801) (← links)
- Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups (Q2080827) (← links)
- An introduction to stochastic bin packing-based server consolidation with conflicts (Q2146367) (← links)
- Integrated bin packing and lot-sizing problem considering the configuration-dependent bin packing process (Q2158010) (← 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)
