Solving a cutting-stock problem with the constraint logic programming language CHIP

DOI10.1016/0895-7177(92)90081-UzbMath0800.68287OpenAlexW2074782926MaRDI QIDQ1197095

Pascal Van Hentenryck, Mehmet Dincbas, Helmut Simonis

Publication date: 16 January 1993

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(92)90081-u

zbMATH Keywords

two-dimensional cutting stock problemlogic programming languageCHIP

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20)

Related Items

Optimization by non-deterministic, lazy rewriting, Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem, CAL: A theoretical background of constraint logic programming and its applications, A logic language for combinatorial optimization, Interval propagation to reason about sets: Definition and implementation of a practical language, Integer programs for logic constraint satisfaction, A logic approach to the resolution of constraints in timetabling, Solving a cutting-stock problem with the constraint logic programming language CHIP, A generic arc-consistency algorithm and its specializations, Constraint satisfaction using constraint logic programming, Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm, Solving real car sequencing problems with ant colony optimization, Constraint satisfaction problems: Algorithms and applications, CHIP, Simulation of hybrid circuits in constraint logic programming, Decomposing constraint satisfaction problems using database techniques

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Embedding Boolean expressions into logic programming
• Solving a cutting-stock problem with the constraint logic programming language CHIP
• Une étude pratique de découpes de panneaux de bois