Pages that link to "Item:Q5202025"
From MaRDI portal
The following pages link to A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems (Q5202025):
Displaying 27 items.
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- An exact approach for the vertex coloring problem (Q429677) (← links)
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190) (← links)
- The flexible and real-time commute trip sharing problems (Q823767) (← links)
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes (Q976033) (← links)
- Bidimensional packing by bilinear programming (Q1016113) (← links)
- An inexact bundle variant suited to column generation (Q1016116) (← links)
- Trim-loss pattern rearrangement and its relevance to the flat-glass industry (Q1055339) (← links)
- A note on modifying a two-dimensional trim-loss algorithm to deal with cutting restrictions (Q1055340) (← links)
- Solving binary cutting stock problems by column generation and branch- and-bound (Q1326509) (← links)
- A column generation approach to job grouping for flexible manufacturing systems (Q1341988) (← links)
- An exact algorithm for IP column generation (Q1360108) (← links)
- Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations (Q1825764) (← links)
- The cutting stock problem in the canvas industry (Q1825765) (← links)
- Solving robust bin-packing problems with a branch-and-price approach (Q2060393) (← links)
- An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems (Q2093186) (← links)
- Column generation extensions of set covering greedy heuristics (Q2102849) (← links)
- Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition (Q2288982) (← links)
- A lexicographic pricer for the fractional bin packing problem (Q2294394) (← links)
- Build-pack planning for hard disk drive assembly with approved vendor matrices and stochastic demands (Q2433468) (← links)
- An inexact bundle approach to cutting-stock problems (Q2899044) (← links)
- A Wide Branching Strategy for the Graph Coloring Problem (Q2940061) (← links)
- A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation (Q3057155) (← links)
- Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs (Q3156731) (← links)
- A branch-and-price algorithm for switch-box routing (Q4785215) (← links)
- Capacity expansion strategies for electric vehicle charging networks: Model, algorithms, and case study (Q6053131) (← links)
- An integer programming column generation principle for heuristic search methods (Q6066729) (← links)
