Solving a cutting-stock problem with the constraint logic programming language CHIP
From MaRDI portal
Cites work
- Embedding Boolean expressions into logic programming
- scientific article; zbMATH DE number 3427118 (Why is no real title available?)
- scientific article; zbMATH DE number 3978351 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- Solving a cutting-stock problem with the constraint logic programming language CHIP
- Une étude pratique de découpes de panneaux de bois
Cited in
(17)- 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
- Decomposing constraint satisfaction problems using database techniques
- CHIP
- Constraint satisfaction problems: Algorithms and applications
- Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem
- Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm
- Solving real car sequencing problems with ant colony optimization
- Optimization by non-deterministic, lazy rewriting
- Instance space analysis for the car sequencing problem
- Interval propagation to reason about sets: Definition and implementation of a practical language
- Simulation of hybrid circuits in constraint logic programming
- CAL: A theoretical background of constraint logic programming and its applications
- A logic language for combinatorial optimization
This page was built for publication: Solving a cutting-stock problem with the constraint logic programming language CHIP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1197095)