Solving nesting problems with non-convex polygons by constraint logic programming

DOI10.1111/1475-3995.00434zbMath1094.68533OpenAlexW2007670071MaRDI QIDQ4814103

Cristina Ribeiro, Maria Antónia Carravilla, José Fernando Oliveira

Publication date: 7 September 2004

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/1475-3995.00434

zbMATH Keywords

packingnofit polygon

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Related Items (8)

An improved typology of cutting and packing problems ⋮ A clique covering MIP model for the irregular strip packing problem ⋮ Dial-a-ride problem: mixed integer programming revisited and constraint programming proposed ⋮ A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands ⋮ Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts ⋮ A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems ⋮ Mixed integer quadratically-constrained programming model to solve the irregular strip packing problem with continuous rotations ⋮ Irregular packing problems: a review of mathematical models

Uses Software

• SICStus

Cites Work

• Unnamed Item
• Solution approaches to irregular nesting problems
• Packing problems
• A Solution of the Rectangular Cutting-Stock Problem
• Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints

This page was built for publication: Solving nesting problems with non-convex polygons by constraint logic programming