Lower bounds and algorithms for the 2-dimensional vector packing problem
From MaRDI portal
Recommendations
- A branch-and-bound algorithm for the two-dimensional vector packing problem
- A branch-and-price algorithm for the two-dimensional vector packing problem
- Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
- scientific article; zbMATH DE number 4195184
- Exact solution of the two-dimensional finite bin packing problem
Cites work
- A branch-and-bound algorithm for the two-dimensional vector packing problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A Linear Programming Approach to the Cutting-Stock Problem
- An algorithm for a class of loading problems
- An improved lower bound for the bin packing problem
- Bin packing can be solved within 1+epsilon in linear time
- Bithreshold Graphs
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- Branch-and-price: Column generation for solving huge integer programs
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound
- scientific article; zbMATH DE number 3890754 (Why is no real title available?)
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1305407 (Why is no real title available?)
- scientific article; zbMATH DE number 795216 (Why is no real title available?)
- Lower bounds and reduction procedures for the bin packing problem
- Multiple-type, two-dimensional bin packing problems: Applications and algorithms
- New Algorithms for Bin Packing
- Properties of some ILP formulations of a class of partitioning problems
- Resource constrained scheduling as generalized bin packing
- Solving binary cutting stock problems by column generation and branch- and-bound
- The ellipsoid method and its consequences in combinatorial optimization
- The Loading Problem
- There is no asymptotic PTAS for two-dimensional vector packing
- Worst-case analyses, linear programming and the bin-packing problem
Cited in
(37)- Properties of some ILP formulations of a class of partitioning problems
- A branch-and-bound algorithm for the two-dimensional vector packing problem
- Multiple-type, two-dimensional bin packing problems: Applications and algorithms
- A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
- An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
- Solving bin packing problems using VRPSolver models
- Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups
- Using VRPSolver to efficiently solve the \textsc{differential harvest problem}
- A generic exact solver for vehicle routing and related problems
- A branch-and-price algorithm for the two-dimensional vector packing problem
- A branch-and-price algorithm for the temporal bin packing problem
- A two-dimensional vector packing model for the efficient use of coil cassettes
- The two-dimensional bin packing problem with variable bin sizes and costs
- Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
- An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs
- Dual inequalities for stabilized column generation revisited
- A Comparative Study of Multi-objective Evolutionary Algorithms for the Bi-objective 2-Dimensional Vector Packing Problem
- Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
- A single machine scheduling problem with two-dimensional vector packing constraints
- scientific article; zbMATH DE number 4195184 (Why is no real title available?)
- An optimization-based heuristic for the machine reassignment problem
- Fast machine reassignment
- Vector bin packing with heterogeneous bins: application to the machine reassignment problem
- Bin packing and related problems: general arc-flow formulation with graph compression
- Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing
- A 4/3-APPROXIMATION ALGORITHM FOR CASSETTE PACKING IN STEEL INDUSTRY
- Approximation schemes for generalized two-dimensional vector packing with application to data placement
- Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem
- Branch-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty
- Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows
- Algorithms for the bin packing problem with scenarios
- Resource allocation algorithms for virtualized service hosting platforms
- Learning-based column generation approach for the vehicle routing problem with release dates and incompatible loading constraints
- Price-and-branch heuristic for vector bin packing
- Classification and evaluation of the algorithms for vector bin packing
- Stabilized branch-and-price algorithms for vector packing problems
- Integer linear programming formulations and heuristic solution approaches for busy time minimization in temporal bin packing
This page was built for publication: Lower bounds and algorithms for the 2-dimensional vector packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5939229)
