A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts (Q6167663): Difference between revisions

Latest revision as of 15:38, 1 August 2024

scientific article; zbMATH DE number 7709263

Language	Label	Description	Also known as
English	A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts	scientific article; zbMATH DE number 7709263

Statements

instance of

scholarly article

0 references

title

A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts (English)

0 references

author

Ali Ekici

0 references

published in

European Journal of Operational Research

0 references

publication date

10 July 2023

0 references

zbMATH Keywords

packing

0 references

variable-sized bin packing

0 references

item conflicts

0 references

large neighborhood search

0 references

lower bound

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejor.2022.12.042

0 references

cites work

Accelerating column generation for variable sized bin-packing problems

0 references

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

0 references

Efficient algorithms for real-life instances of the variable size bin packing problem

0 references

Heuristics for determining the number of warehouses for storing non-compatible products

0 references

Distributed Approximation Algorithm for Resource Clustering

0 references

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

0 references

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

0 references

Q4083324

0 references

Solving the variable size bin packing problem with discretized formulations

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

Bin packing problem with conflicts and item fragmentation

0 references

A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts

0 references

Online variable-sized bin packing with conflicts

0 references

An APTAS for Generalized Cost Variable-Sized Bin Packing

0 references

On Bin Packing with Conflicts

0 references

New classes of fast lower bounds for bin packing problems

0 references

New heuristics for one-dimensional bin-packing

0 references

Variable Sized Bin Packing

0 references

Heuristics and lower bounds for the bin packing problem with conflicts

0 references

Heuristics for the variable sized bin-packing problem

0 references

Relaxations and exact solution of the variable sized bin packing problem

0 references

Variable neighbourhood search for the variable sized bin packing problem

0 references

Applying tabu search with influential diversification to multiprocessor scheduling

0 references

An approximation scheme for bin packing with conflicts

0 references

Approximation algorithms for time constrained scheduling

0 references

Approximation algorithms for combinatorial problems

0 references

Algorithms for the variable sized bin packing problem

0 references

New lower bounds for bin packing problems with conflicts

0 references

Online variable-sized bin packing

0 references

Thirty years of heterogeneous vehicle routing

0 references

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

0 references

Efficient algorithms for the offline variable sized bin-packing problem

0 references

Q2898516

0 references

Q3993418

0 references

An Efficient Approximation Scheme for Variable-Sized Bin Packing

0 references

Algorithms for the Bin Packing Problem with Conflicts

0 references

The freight consolidation and containerization problem

0 references

BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem

0 references

Q4290987

0 references

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

0 references

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

0 references

Tighter bounds of the First Fit algorithm for the bin-packing problem

0 references

Worst-case analysis of the FFH algorithm for online variable-sized bin packing

0 references

Identifiers

DOI

10.1016/j.ejor.2022.12.042

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6167663

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2022.12.042
+Normal rank
@@ Property / OpenAlex ID @@
+W4313479085
@@ Property / OpenAlex ID: W4313479085 / rank @@
+Normal rank
@@ Property / cites work @@
+Accelerating column generation for variable sized bin-packing problems
+Normal rank
@@ Property / cites work @@
+A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for real-life instances of the variable size bin packing problem
+Normal rank
@@ Property / cites work @@
+Heuristics for determining the number of warehouses for storing non-compatible products
+Normal rank
@@ Property / cites work @@
+Distributed Approximation Algorithm for Resource Clustering
+Normal rank
@@ Property / cites work @@
+Bin packing and related problems: general arc-flow formulation with graph compression
+Normal rank
@@ Property / cites work @@
+Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing
+Normal rank
@@ Property / cites work @@
+Q4083324
@@ Property / cites work: Q4083324 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the variable size bin packing problem with discretized formulations
+Normal rank
@@ Property / cites work @@
+Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
+Normal rank
@@ Property / cites work @@
+Bin packing and cutting stock problems: mathematical models and exact algorithms
+Normal rank
@@ Property / cites work @@
+Bin packing problem with conflicts and item fragmentation
+Normal rank
@@ Property / cites work @@
+A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts
+Normal rank
@@ Property / cites work @@
+Online variable-sized bin packing with conflicts
@@ Property / cites work: Online variable-sized bin packing with conflicts / rank @@
+Normal rank
@@ Property / cites work @@
+An APTAS for Generalized Cost Variable-Sized Bin Packing
+Normal rank
@@ Property / cites work @@
+On Bin Packing with Conflicts
@@ Property / cites work: On Bin Packing with Conflicts / rank @@
+Normal rank
@@ Property / cites work @@
+New classes of fast lower bounds for bin packing problems
+Normal rank
@@ Property / cites work @@
+New heuristics for one-dimensional bin-packing
@@ Property / cites work: New heuristics for one-dimensional bin-packing / rank @@
+Normal rank
@@ Property / cites work @@
+Variable Sized Bin Packing
@@ Property / cites work: Variable Sized Bin Packing / rank @@
+Normal rank
@@ Property / cites work @@
+Heuristics and lower bounds for the bin packing problem with conflicts
+Normal rank
@@ Property / cites work @@
+Heuristics for the variable sized bin-packing problem
+Normal rank
@@ Property / cites work @@
+Relaxations and exact solution of the variable sized bin packing problem
+Normal rank
@@ Property / cites work @@
+Variable neighbourhood search for the variable sized bin packing problem
+Normal rank
@@ Property / cites work @@
+Applying tabu search with influential diversification to multiprocessor scheduling
+Normal rank
@@ Property / cites work @@
+An approximation scheme for bin packing with conflicts
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for time constrained scheduling
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+Algorithms for the variable sized bin packing problem
+Normal rank
@@ Property / cites work @@
+New lower bounds for bin packing problems with conflicts
+Normal rank
@@ Property / cites work @@
+Online variable-sized bin packing
@@ Property / cites work: Online variable-sized bin packing / rank @@
+Normal rank
@@ Property / cites work @@
+Thirty years of heterogeneous vehicle routing
@@ Property / cites work: Thirty years of heterogeneous vehicle routing / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the one-dimensional bin packing problem with a weight annealing heuristic
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for the offline variable sized bin-packing problem
+Normal rank
@@ Property / cites work @@
+Q2898516
@@ Property / cites work: Q2898516 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Approximation Scheme for Variable-Sized Bin Packing
+Normal rank
@@ Property / cites work @@
+Algorithms for the Bin Packing Problem with Conflicts
+Normal rank
@@ Property / cites work @@
+The freight consolidation and containerization problem
+Normal rank
@@ Property / cites work @@
+BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
+Normal rank
@@ Property / cites work @@
+Q4290987
@@ Property / cites work: Q4290987 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact solution of bin-packing problems using column generation and branch-and-bound
+Normal rank
@@ Property / cites work @@
+A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
+Normal rank
@@ Property / cites work @@
+Tighter bounds of the First Fit algorithm for the bin-packing problem
+Normal rank
@@ Property / cites work @@
+Worst-case analysis of the FFH algorithm for online variable-sized bin packing
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6167663