Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows
From MaRDI portal
Publication:6106578
DOI10.1016/j.cor.2023.106267MaRDI QIDQ6106578
M. I. M. Wahab, Yanru Chen, Junheng Li, Mujin Gao
Publication date: 3 July 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
time windowshybrid methodadaptive large neighborhood searchbranch-and-price-and-cuttwo-dimensional vector packing problem
Cites Work
- Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
- A single machine scheduling problem with two-dimensional vector packing constraints
- Routing a mixed fleet of electric and conventional vehicles
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Bin packing and related problems: general arc-flow formulation with graph compression
- Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing
- Approximation schemes for generalized two-dimensional vector packing with application to data placement
- Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem
- Stabilized branch-and-price algorithms for vector packing problems
- An asymptotic approximation scheme for the concave cost bin packing problem
- A note on the problem of reporting maximal cliques
- Sequencing surgical cases in a day-care environment: an exact branch-and-price approach
- Approximation algorithms for combinatorial problems
- Resource constrained scheduling as generalized bin packing
- Exact solution of bin-packing problems using column generation and branch-and-bound
- A branch-and-bound algorithm for the two-dimensional vector packing problem
- The robust vehicle routing problem with time windows: solution by branch and price and cut
- A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
- An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
- Multi-trip time-dependent vehicle routing problem with time windows
- Optimizing routing and delivery patterns with multi-compartment vehicles
- Solving bin packing problems using VRPSolver models
- New exact techniques applied to a class of network flow formulations
- A generic exact solver for vehicle routing and related problems
- A branch-and-price algorithm for the two-dimensional vector packing problem
- A branch-and-price algorithm for the temporal bin packing problem
- A two-dimensional vector packing model for the efficient use of coil cassettes
- Bin packing with general cost structures
- Solving the one-dimensional bin packing problem with a weight annealing heuristic
- Multi-objective temporal bin packing problem: an application in cloud computing
- A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations
- Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
- A Set-Covering-Based Heuristic Approach for Bin-Packing Problems
- Algorithms for the Bin Packing Problem with Conflicts
- An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Decomposition Principle for Linear Programs
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- Algorithm 457: finding all cliques of an undirected graph
- Lower bounds and algorithms for the 2-dimensional vector packing problem
- A combinatorial flow-based formulation for temporal bin packing problems
This page was built for publication: Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows
