Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows (Q6106578): Difference between revisions

Latest revision as of 13:25, 1 August 2024

scientific article; zbMATH DE number 7705480

Language	Label	Description	Also known as
English	Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows	scientific article; zbMATH DE number 7705480

Statements

instance of

scholarly article

0 references

title

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

0 references

0 references

0 references

0 references

0 references

Computers \& Operations Research

0 references

publication date

3 July 2023

0 references

zbMATH Keywords

two-dimensional vector packing problem

0 references

time windows

0 references

hybrid method

0 references

branch-and-price-and-cut

0 references

adaptive large neighborhood search

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem

0 references

Multi-objective temporal bin packing problem: an application in cloud computing

0 references

An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems

0 references

A single machine scheduling problem with two-dimensional vector packing constraints

0 references

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

0 references

Algorithm 457: finding all cliques of an undirected graph

0 references

Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing

0 references

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

0 references

Sequencing surgical cases in a day-care environment: an exact branch-and-price approach

0 references

A note on the problem of reporting maximal cliques

0 references

A two-dimensional vector packing model for the efficient use of coil cassettes

0 references

Decomposition Principle for Linear Programs

0 references

New exact techniques applied to a class of network flow formulations

0 references

A branch-and-price algorithm for the temporal bin packing problem

0 references

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

0 references

Bin packing with general cost structures

0 references

Algorithms for the Bin Packing Problem with Conflicts

0 references

Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem

0 references

Optimizing routing and delivery patterns with multi-compartment vehicles

0 references

Resource constrained scheduling as generalized bin packing

0 references

Routing a mixed fleet of electric and conventional vehicles

0 references

Stabilized branch-and-price algorithms for vector packing problems

0 references

A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function

0 references

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

0 references

Approximation algorithms for combinatorial problems

0 references

An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing

0 references

A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations

0 references

An asymptotic approximation scheme for the concave cost bin packing problem

0 references

Solving the one-dimensional bin packing problem with a weight annealing heuristic

0 references

The robust vehicle routing problem with time windows: solution by branch and price and cut

0 references

Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem

0 references

Compact integer linear programming formulations for the temporal bin packing problem with fire-ups

0 references

A combinatorial flow-based formulation for temporal bin packing problems

0 references

A Set-Covering-Based Heuristic Approach for Bin-Packing Problems

0 references

Multi-trip time-dependent vehicle routing problem with time windows

0 references

A generic exact solver for vehicle routing and related problems

0 references

Solving bin packing problems using VRPSolver models

0 references

Approximation schemes for generalized two-dimensional vector packing with application to data placement

0 references

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

0 references

Exact solution of bin-packing problems using column generation and branch-and-bound

0 references

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

0 references

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

0 references

Identifiers

DOI

10.1016/j.cor.2023.106267

0 references

Mathematics Subject Classification ID

90Bxx

0 references

zbMATH DE Number

7705480

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6106578

@@ Property / cites work @@
+Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
+Normal rank
@@ Property / cites work @@
+Multi-objective temporal bin packing problem: an application in cloud computing
+Normal rank
@@ Property / cites work @@
+An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems
+Normal rank
@@ Property / cites work @@
+A single machine scheduling problem with two-dimensional vector packing constraints
+Normal rank
@@ Property / cites work @@
+Bin packing and related problems: general arc-flow formulation with graph compression
+Normal rank
@@ Property / cites work @@
+Algorithm 457: finding all cliques of an undirected graph
+Normal rank
@@ Property / cites work @@
+Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing
+Normal rank
@@ Property / cites work @@
+Lower bounds and algorithms for the 2-dimensional vector packing problem
+Normal rank
@@ Property / cites work @@
+Sequencing surgical cases in a day-care environment: an exact branch-and-price approach
+Normal rank
@@ Property / cites work @@
+A note on the problem of reporting maximal cliques
+Normal rank
@@ Property / cites work @@
+A two-dimensional vector packing model for the efficient use of coil cassettes
+Normal rank
@@ Property / cites work @@
+Decomposition Principle for Linear Programs
@@ Property / cites work: Decomposition Principle for Linear Programs / rank @@
+Normal rank
@@ Property / cites work @@
+New exact techniques applied to a class of network flow formulations
+Normal rank
@@ Property / cites work @@
+A branch-and-price algorithm for the temporal bin packing problem
+Normal rank
@@ Property / cites work @@
+Bin packing and cutting stock problems: mathematical models and exact algorithms
+Normal rank
@@ Property / cites work @@
+Bin packing with general cost structures
@@ Property / cites work: Bin packing with general cost structures / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for the Bin Packing Problem with Conflicts
+Normal rank
@@ Property / cites work @@
+Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem
+Normal rank
@@ Property / cites work @@
+Optimizing routing and delivery patterns with multi-compartment vehicles
+Normal rank
@@ Property / cites work @@
+Resource constrained scheduling as generalized bin packing
+Normal rank
@@ Property / cites work @@
+Routing a mixed fleet of electric and conventional vehicles
+Normal rank
@@ Property / cites work @@
+Stabilized branch-and-price algorithms for vector packing problems
+Normal rank
@@ Property / cites work @@
+A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
+Normal rank
@@ Property / cites work @@
+Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
+Normal rank
@@ Property / cites work @@
+A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations
+Normal rank
@@ Property / cites work @@
+An asymptotic approximation scheme for the concave cost bin packing problem
+Normal rank
@@ Property / cites work @@
+Solving the one-dimensional bin packing problem with a weight annealing heuristic
+Normal rank
@@ Property / cites work @@
+The robust vehicle routing problem with time windows: solution by branch and price and cut
+Normal rank
@@ Property / cites work @@
+Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
+Normal rank
@@ Property / cites work @@
+A combinatorial flow-based formulation for temporal bin packing problems
+Normal rank
@@ Property / cites work @@
+A Set-Covering-Based Heuristic Approach for Bin-Packing Problems
+Normal rank
@@ Property / cites work @@
+Multi-trip time-dependent vehicle routing problem with time windows
+Normal rank
@@ Property / cites work @@
+A generic exact solver for vehicle routing and related problems
+Normal rank
@@ Property / cites work @@
+Solving bin packing problems using VRPSolver models
+Normal rank
@@ Property / cites work @@
+Approximation schemes for generalized two-dimensional vector packing with application to data placement
+Normal rank
@@ Property / cites work @@
+A branch-and-bound algorithm for the two-dimensional vector packing problem
+Normal rank
@@ Property / cites work @@
+Exact solution of bin-packing problems using column generation and branch-and-bound
+Normal rank
@@ Property / cites work @@
+A branch-and-price algorithm for the two-dimensional vector packing problem
+Normal rank
@@ Property / cites work @@
+A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
+Normal rank