Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts
From MaRDI portal
Publication:6087527
DOI10.1016/j.ejor.2023.08.009arXiv2206.00032MaRDI QIDQ6087527
Juan J. Lastra-Díaz, M. Teresa Ortuño
Publication date: 15 November 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.00032
Cites Work
- Unnamed Item
- Unnamed Item
- Irregular packing: MILP model based on a polygonal enclosure
- Quasi-phi-functions and optimal packing of ellipses
- Robust mixed-integer linear programming models for the irregular strip packing problem
- Phi-functions for 2D objects formed by line segments and circular arcs
- Recent advances on two-dimensional bin packing problems
- A branch and bound algorithm for the strip packing problem
- Cutting circles and polygons from area-minimizing rectangles
- Solution approaches to irregular nesting problems
- Compaction and separation algorithms for non-convex polygons and their applications
- Optimal packing and covering in the plane are NP-complete
- Packing problems
- On genetic algorithms for the packing of polygons
- Mathematical model and method of searching for a local extremum for the non-convex oriented polygons allocation problem
- TOPOS -- A new constructive algorithm for nesting problems
- A review of the application of meta-heuristic algorithms to 2D strip packing problems
- A clique covering MIP model for the irregular strip packing problem
- A customized branch-and-bound approach for irregular shape nesting
- Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations
- Placement problems for irregular objects: mathematical modeling, optimization and applications
- A typology of cutting and packing problems
- A 2-exchange heuristic for nesting problems
- An algorithm for polygon placement using a bottom-left strategy
- The nesting problem in the leather manufacturing industry
- Algorithms for the decomposition of a polygon into convex polygons
- Conflict graphs in solving integer programming problems
- A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems
- Exact solution techniques for two-dimensional cutting and packing
- A fully general, exact algorithm for nesting irregular shapes
- Mathematical model and efficient algorithms for object packing problem
- Mixed-integer programming models for nesting problems
- Irregular packing problems: a review of mathematical models
- Large-scale clique cover of real-world networks
- Raster penetration map applied to the irregular packing problem
- Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
- A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
- The geometry of nesting problems: a tutorial
- An improved typology of cutting and packing problems
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- A tutorial in irregular shape packing problems
- Introduction to Interval Analysis
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- A Solution of the Rectangular Cutting-Stock Problem
- Optimized Object Packings Using Quasi-Phi-Functions
- Solving nesting problems with non-convex polygons by constraint logic programming
- Decomposition Algorithm for Irregular Placement Problems
- Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
- Multistage Cutting Stock Problems of Two and More Dimensions
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Benchmarking optimization software with performance profiles.
- Polygon decomposition for efficient construction of Minkowski sums
- An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects
This page was built for publication: Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts
