Solving bin packing problems using VRPSolver models (Q2033390)

From MaRDI portal

Revision as of 01:01, 26 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Solving bin packing problems using VRPSolver models	scientific article

Statements

scholarly article

0 references

Solving bin packing problems using VRPSolver models (English)

0 references

zbMATH Open document ID

0 references

10.1007/s43069-020-00047-8

0 references

Artur Alves Pessoa

0 references

0 references

0 references

SN Operations Research Forum

0 references

publication date

17 June 2021

0 references

full work available at URL

https://hal.inria.fr/hal-02986956/file/main-clear.pdf

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

integer programming

0 references

column generation

0 references

packing

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem

0 references

An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts

0 references

Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items

0 references

A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting

0 references

Bin packing and related problems: general arc-flow formulation with graph compression

0 references

Lower bounds and algorithms for the 2-dimensional vector packing problem

0 references

A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints

0 references

Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems

0 references

Bin packing and cutting stock problems: mathematical models and exact algorithms

0 references

JuMP: A Modeling Language for Mathematical Optimization

0 references

New classes of fast lower bounds for bin packing problems

0 references

A new branching strategy for time constrained routing problems with application to backhauling

0 references

A Linear Programming Approach to the Cutting-Stock Problem

0 references

Relaxations and exact solution of the variable sized bin packing problem

0 references

Maximum-weight stable sets and safe lower bounds for graph coloring

0 references

Stabilized branch-and-price algorithms for vector packing problems

0 references

Shortest Path Problems with Resource Constraints

0 references

Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows

0 references

Mathematical Methods of Organizing and Planning Production

0 references

Algorithms for packing and scheduling problems. (Abstract of thesis)

0 references

Improved Branch-Cut-and-Price for Capacitated Vehicle Routing

0 references

New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows

0 references

Improved branch-cut-and-price for capacitated vehicle routing

0 references

Limited memory rank-1 cuts for vehicle routing problems

0 references

Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems

0 references

Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation

0 references

A generic exact solver for Vehicle Routing and related problems

0 references

0 references

A Minimal Algorithm for the 0-1 Knapsack Problem

0 references

Primal Heuristics for Branch and Price: The Assets of Diving Methods

0 references

Using Extra Dual Cuts to Accelerate Column Generation

0 references

Solving binary cutting stock problems by column generation and branch- and-bound

0 references

Reformulation and Decomposition of Integer Programs

0 references

Heuristics for the integer one-dimensional cutting stock problem: A computational study

0 references

A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems

0 references

A branch-and-price algorithm for the two-dimensional vector packing problem

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2033390

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2033390&oldid=36692323"