Pages that link to "Item:Q3275357"
From MaRDI portal
The following pages link to A Linear Programming Approach to the Cutting-Stock Problem (Q3275357):
Displaying 50 items.
- The shortest path problem with forbidden paths (Q146692) (← links)
- Large-scale optimization with the primal-dual column generation method (Q266408) (← links)
- 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)
- Optimal relay node placement in delay constrained wireless sensor network design (Q297218) (← links)
- Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory (Q314827) (← links)
- Scheduling pumpoff operations in onshore oilfields under electric-power constraints (Q320129) (← links)
- A branch-and-price algorithm for stable workforce assignments with hierarchical skills (Q322747) (← links)
- Origin and early evolution of corner polyhedra (Q323202) (← links)
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- Hybrid column generation for large-size covering integer programs: application to transportation planning (Q336412) (← links)
- A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems (Q336709) (← links)
- Mathematical programming algorithms for bin packing problems with item fragmentation (Q336982) (← links)
- A new formulation and approach for the black and white traveling salesman problem (Q337265) (← links)
- Supervised classification and mathematical optimization (Q339559) (← links)
- Solution approaches for the cutting stock problem with setup cost (Q339571) (← links)
- A constraint programming based column generation approach to nurse rostering problems (Q339698) (← links)
- Determining the \(K\)-best solutions of knapsack problems (Q342015) (← 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 constrained compartmentalized knapsack problem: mathematical models and solution methods (Q421557) (← links)
- A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems (Q429470) (← links)
- Cutting stock with no three parts per pattern: work-in-process and pattern minimization (Q429692) (← links)
- A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size (Q439486) (← links)
- Reducing the number of cuts in generating three-staged cutting patterns (Q439502) (← links)
- Trim loss optimization by an improved differential evolution (Q474531) (← links)
- Branch-and-price approach for the multi-skill project scheduling problem (Q479223) (← links)
- A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects (Q480780) (← links)
- Turning restriction design in traffic networks with a budget constraint (Q486412) (← links)
- A new warmstarting strategy for the primal-dual column generation method (Q494315) (← links)
- An improved approximation scheme for variable-sized bin packing (Q504994) (← 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)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
- On the cutting stock problem under stochastic demand (Q610975) (← links)
- A survey of dual-feasible and superadditive functions (Q610986) (← links)
- On the one-dimensional stock cutting problem in the paper tube industry (Q640306) (← links)
- The double pivot simplex method (Q684156) (← links)
- Polylithic modeling and solution approaches using algebraic modeling systems (Q691438) (← links)
- Recent advances on two-dimensional bin packing problems (Q697576) (← links)
- Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application (Q706851) (← links)
- Production planning with approved vendor matrices for a hard-disk drive manufacturer (Q706906) (← links)
- Optimal wafer cutting in shuttle layout problems (Q719028) (← links)
- A short discussion of the OR crisis (Q721666) (← 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)
- A shortest path-based approach to the multileaf collimator sequencing problem (Q765342) (← links)
