Pages that link to "Item:Q5202025"

The following pages link to A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems (Q5202025):

Displaying 7 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)
• Solving robust bin-packing problems with a branch-and-price approach (Q2060393) (← links)
• Column generation extensions of set covering greedy heuristics (Q2102849) (← links)