A combinatorial flow-based formulation for temporal bin packing problems

Related Items

Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows

Cites Work

Unnamed Item
Bin packing and cutting stock problems: mathematical models and exact algorithms
Optimal interval scheduling with a resource constraint
Resource allocation with time intervals
New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
Scheduling jobs with fixed start and end times
Maximizing the value of a space mission
Off-line admission control for general scheduling problems
Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
Mathematical models and decomposition methods for the multiple knapsack problem
LP models for bin packing and cutting stock problems
Decomposition and reformulation of integer linear programming problems. (Summary)
An iterative dynamic programming approach for the temporal knapsack problem
Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups
Arc flow formulations based on dynamic programming: theoretical foundations and applications
Improved flow-based formulations for the skiving stock problem
A branch-and-price algorithm for the temporal bin packing problem
Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities
Multi-objective temporal bin packing problem: an application in cloud computing
Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
Exact solution of network flow models with strong relaxations
Mathematical Methods of Organizing and Planning Production
Branch-and-Price: Column Generation for Solving Huge Integer Programs
A Linear Programming Approach to the Cutting-Stock Problem
Interval scheduling: A survey
Bandwidth Allocation with Preemption
New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
Consistency Cuts for Dantzig-Wolfe Reformulations
Primal Heuristics for Branch and Price: The Assets of Diving Methods
Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
The Temporal Knapsack Problem and Its Solution
A unified approach to approximating resource allocation and scheduling
Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation