Pages that link to "Item:Q1197095"
From MaRDI portal
The following pages link to Solving a cutting-stock problem with the constraint logic programming language CHIP (Q1197095):
Displaying 17 items.
- CHIP (Q15982) (← links)
- Interval propagation to reason about sets: Definition and implementation of a practical language (Q679421) (← links)
- Simulation of hybrid circuits in constraint logic programming (Q805302) (← links)
- CAL: A theoretical background of constraint logic programming and its applications (Q908680) (← links)
- A logic language for combinatorial optimization (Q918429) (← links)
- Integer programs for logic constraint satisfaction (Q1193860) (← links)
- A logic approach to the resolution of constraints in timetabling (Q1194718) (← links)
- Solving a cutting-stock problem with the constraint logic programming language CHIP (Q1197095) (← links)
- A generic arc-consistency algorithm and its specializations (Q1199922) (← links)
- Constraint satisfaction using constraint logic programming (Q1204868) (← links)
- Decomposing constraint satisfaction problems using database techniques (Q1321054) (← links)
- Constraint satisfaction problems: Algorithms and applications (Q1809839) (← links)
- Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem (Q2170201) (← links)
- Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm (Q2268503) (← links)
- Solving real car sequencing problems with ant colony optimization (Q2503217) (← links)
- Optimization by non-deterministic, lazy rewriting (Q5055730) (← links)
- Instance space analysis for the car sequencing problem (Q6638878) (← links)
