Solving large combinatorial problems in logic programming
From MaRDI portal
Recommendations
Cited in
(25)- Industrial linear optimization problems solved by constraint logic programming
- A generic arc-consistency algorithm and its specializations
- Constraint satisfaction using constraint logic programming
- Choice procedure in fuzzy multicriteria decision analysis based on pairwise comparisons
- Combination of local search and CLP in the vehicle-fleet scheduling problem
- Fuzzy sets and decision analysis
- Model-based inference in CHARME.
- Reduction algorithms for solving large systems of logical equations
- How efficient is a global constraint in practice? A fair experimental framework
- Introducing global constraints in CHIP
- Running time experiments on some algorithms for solving propositional satisfiability problems
- New constructs for the description of combinatorial optimization problems in algebraic modeling languages
- Enhancing CLP branch and bound techniques for scheduling problems
- A column generation model for a scheduling problem with maintenance constraints
- scientific article; zbMATH DE number 1852952 (Why is no real title available?)
- Propositional calculus problems in CHIP
- Path consistency in clp(FD)
- The Synchronized Dynamic Vehicle Dispatching Problem
- Interval propagation to reason about sets: Definition and implementation of a practical language
- A constraint programming-based solution approach for medical resident scheduling problems
- Compiling a default reasoning system into Prolog
- Symbolic constraint handling through unification in finite algebras
- Scheduling and routing of automated guided vehicles: A hybrid approach
- Models for global constraint applications
- A logic language for combinatorial optimization
This page was built for publication: Solving large combinatorial problems in logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5751930)
