CHIP

swMATH3450MaRDI QIDQ15982FDOQ15982

Author name not available (Why is that?)

Described by source

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

Cited In (80)

• Detection of the discrete convexity of polyominoes
• CLP\(({\mathfrak R})\) and some electrical engineering problems
• A closed-form evaluation for Datalog queries with integer (gap)-order constraints
• Balancing and scheduling of flexible mixed model assembly lines
• Using constraint programming for solving RCPSP/MAX-cal
• Global propagation of side constraints for solving over-constrained problems
• New filtering for the cumulative constraint in the context of non-overlapping rectangles
• Constraint programming and operations research
• The Boolean Constraint Solver of SWI-Prolog (System Description)
• Interval propagation to reason about sets: Definition and implementation of a practical language
• Undirected forest constraints
• A modeling layer for constraint-programming libraries
• Global constraint catalogue: past, present and future
• Constraint and integer programming in OPL
• Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption.
• How efficient is a global constraint in practice? A fair experimental framework
• Title not available (Why is that?)
• Explaining the \texttt{cumulative} propagator
• Application of constraint logic programming to asset and liability management in banks
• Optimal length resolution refutations of difference constraint systems
• Industrial linear optimization problems solved by constraint logic programming
• Introducing global constraints in CHIP
• Exploiting subproblem dominance in constraint programming
• Verification of FPGA layout generators in higher-order logic
• Models for global constraint applications
• Nurse rostering problems -- a bibliographic survey.
• On logical constraints in logic programming
• Title not available (Why is that?)
• The virtuality of constraints and the constraints of virtuality
• Model-driven visualizations of constraint-based local search
• Title not available (Why is that?)
• On the relations between SAT and CSP enumerative algorithms
• A quadratic edge-finding filtering algorithm for cumulative resource constraints
• Constraint programming model for multi-manned assembly line balancing problem
• Confidence-based reasoning in stochastic constraint programming
• Localizer
• Lparse Programs Revisited: Semantics and Representation of Aggregates
• Local consistency for extended CSPs
• Local search and constraint programming for the post enrolment-based course timetabling problem
• IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG
• The job shop scheduling problem: Conventional and new solution techniques
• Using dual presolving reductions to reformulate cumulative constraints
• CAL: A theoretical background of constraint logic programming and its applications
• Solving RCPSP/max by lazy clause generation
• Filtering algorithms for the NValue constraint
• Towards constraint-based school timetabling
• Model-based inference in CHARME.
• Synchronized sweep algorithms for scalable scheduling constraints
• A logic language for combinatorial optimization
• Redundant cumulative constraints to compute preemptive bounds
• A hypergraph model for constraint logic programming and applications to bus drivers' scheduling
• Computational complexity and constraint logic programming languages
• A generic arc-consistency algorithm and its specializations
• A resolution principle for constrained logics
• Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction
• Standard forms for rational linear arithmetic in constraint logic programming.
• Detecting infeasibility and generating cuts for mixed integer programming using constraint programming
• Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm
• SD-solver: Towards a ``Multidirectional CLP-based simulation tool. Framework and short financial examples
• A microkernel architecture for constraint programming
• Dashed strings for string constraint solving
• Constraint satisfaction using constraint logic programming
• Simulation of hybrid circuits in constraint logic programming
• Algorithmes hybrides génériques pour la résolution de problèmes de satisfaction de contraintes
• Dominance constraints with Boolean connectives: A model-eliminative treatment
• A column generation model for a scheduling problem with maintenance constraints
• Design for AJACS, yet another Java constraint programming framework1 1The authors would like to thank the anonymous referees for their constructive review of an earlier version of this article. Universidade de Évora, CENTRIA and FundaçLãTo da CiêCncia e Tecnologia (under contract PRAXIS P/EEI/10191/98 “OAR”) are acknowledged for their support of the work described herein.
• A hybrid constraint programming/mixed integer programming framework for the preventive signaling maintenance crew scheduling problem
• Scheduling scientific experiments for comet exploration
• Constraint databases: promising technology or just intellectual exercise?
• Horizontally elastic edge-finder algorithm for cumulative resource constraint revisited
• Strong polynomiality of resource constraint propagation
• Stochastic Planning and Scheduling with Logic-Based Benders Decomposition
• A MinCumulative resource constraint
• Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem
• Tesseral spatio-temporal reasoning for multi-dimensional data
• Description, Implementation, and Evaluation of a Generic Design for Tabled CLP
• Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini
• From eager or lazy constrained data acquisition: A general framework
• An \(O(n^2)\) algorithm for time-bound adjustments for the cumulative scheduling problem

This page was built for software: CHIP