Solving bin packing problems using VRPSolver models
From MaRDI portal
Publication:2033390
DOI10.1007/s43069-020-00047-8zbMath1470.90106OpenAlexW3156656577MaRDI QIDQ2033390
Eduardo Uchoa, Artur Alves Pessoa, Ruslan Sadykov
Publication date: 17 June 2021
Published in: SN Operations Research Forum (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-02986956/file/main-clear.pdf
Related Items (3)
Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows ⋮ New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources ⋮ Using VRPSolver to efficiently solve the \textsc{differential harvest problem}
Uses Software
Cites Work
- Unnamed Item
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Bin packing and related problems: general arc-flow formulation with graph compression
- Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items
- Relaxations and exact solution of the variable sized bin packing problem
- Stabilized branch-and-price algorithms for vector packing problems
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- Solving binary cutting stock problems by column generation and branch- and-bound
- Algorithms for packing and scheduling problems. (Abstract of thesis)
- Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems
- Limited memory rank-1 cuts for vehicle routing problems
- A new branching strategy for time constrained routing problems with application to backhauling
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- Maximum-weight stable sets and safe lower bounds for graph coloring
- A generic exact solver for Vehicle Routing and related problems
- A branch-and-price algorithm for the two-dimensional vector packing problem
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- Improved branch-cut-and-price for capacitated vehicle routing
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- Mathematical Methods of Organizing and Planning Production
- Using Extra Dual Cuts to Accelerate Column Generation
- A Linear Programming Approach to the Cutting-Stock Problem
- 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
- Reformulation and Decomposition of Integer Programs
- A Minimal Algorithm for the 0-1 Knapsack Problem
- New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
- Primal Heuristics for Branch and Price: The Assets of Diving Methods
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- Improved Branch-Cut-and-Price for Capacitated Vehicle Routing
- Shortest Path Problems with Resource Constraints
- JuMP: A Modeling Language for Mathematical Optimization
- Lower bounds and algorithms for the 2-dimensional vector packing problem
- New classes of fast lower bounds for bin packing problems
This page was built for publication: Solving bin packing problems using VRPSolver models
