Solving bin packing problems using VRPSolver models
From MaRDI portal
Recommendations
- Solving the variable size bin packing problem with discretized formulations
- Relaxations and exact solution of the variable sized bin packing problem
- Models and complexity of multibin packing problems
- Solving robust bin-packing problems with a branch-and-price approach
- LP models for bin packing and cutting stock problems
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Modeling of packing problems
Cites work
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- A Linear Programming Approach to the Cutting-Stock Problem
- A Minimal Algorithm for the 0-1 Knapsack Problem
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- A branch-and-price algorithm for the two-dimensional vector packing problem
- A generic exact solver for Vehicle Routing and related problems
- A new branching strategy for time constrained routing problems with application to backhauling
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
- Algorithms for packing and scheduling problems. (Abstract of thesis)
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
- 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
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- Improved branch-cut-and-price for capacitated vehicle routing
- Improved branch-cut-and-price for capacitated vehicle routing
- JuMP: a modeling language for mathematical optimization
- Limited memory rank-1 cuts for vehicle routing problems
- Lower bounds and algorithms for the 2-dimensional vector packing problem
- Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
- Maximum-weight stable sets and safe lower bounds for graph coloring
- New classes of fast lower bounds for bin packing problems
- New enhancements for the exact solution of the vehicle routing problem with time windows
- Primal Heuristics for Branch and Price: The Assets of Diving Methods
- Reformulation and decomposition of integer programs
- Relaxations and exact solution of the variable sized bin packing problem
- Shortest Path Problems with Resource Constraints
- Solving binary cutting stock problems by column generation and branch- and-bound
- Stabilized branch-and-price algorithms for vector packing problems
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- Using extra dual cuts to accelerate column generation
Cited in
(15)- Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items
- Branch and Price for Submodular Bin Packing
- VNS matheuristic for a bin packing problem with a color constraint
- A Numerically Exact Algorithm for the Bin-Packing Problem
- Algorithms for the bin packing problem with scenarios
- Solving robust bin-packing problems with a branch-and-price approach
- Using VRPSolver to efficiently solve the \textsc{differential harvest problem}
- LP models for bin packing and cutting stock problems
- Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows
- Stabilized branch-and-price algorithms for vector packing problems
- A generic exact solver for Vehicle Routing and related problems
- scientific article; zbMATH DE number 4070618 (Why is no real title available?)
- New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources
- A generic exact solver for vehicle routing and related problems
- Bin packing and related problems: general arc-flow formulation with graph compression
This page was built for publication: Solving bin packing problems using VRPSolver models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2033390)
