A language and a program for stating and solving combinatorial problems
DOI10.1016/0004-3702(78)90029-2zbMATH Open0374.68060OpenAlexW2002597376WikidataQ56031619 ScholiaQ56031619MaRDI QIDQ1245009FDOQ1245009
Authors: Jean-Louis Laurière 
Publication date: 1978
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(78)90029-2
Pattern recognition, speech recognition (68T10) Integer programming (90C10) Mathematical programming (90Cxx) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Cites Work
- An Automatic Method of Solving Discrete Programming Problems
- Title not available (Why is that?)
- The Traveling-Salesman Problem and Minimum Spanning Trees
- Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
- The traveling-salesman problem and minimum spanning trees: Part II
- Branch-and-Bound Methods: A Survey
- Title not available (Why is that?)
- Title not available (Why is that?)
- Planning in a hierarchy of abstraction spaces
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An algorithm for the 0/1 Knapsack problem
- A technique for colouring a graph applicable to large scale timetabling problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (31)
- Propositional calculus problems in CHIP
- Constraint programming and operations research
- A constraint programming primer
- Interval propagation to reason about sets: Definition and implementation of a practical language
- Undirected forest constraints
- Improved filtering for weighted circuit constraints
- Intruder alert! Optimization models for solving the mobile robot graph-clear problem
- Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption.
- New constructs for the description of combinatorial optimization problems in algebraic modeling languages
- A new order relation on fuzzy soft sets and its application
- Constraint reasoning
- Tractability-preserving transformations of global cost functions
- A linear and discrete programming framework for representing qualitative knowledge
- The design of the zinc modelling language
- Combining Two Structured Domains for Modeling Various Graph Matching Problems
- Using dual presolving reductions to reformulate cumulative constraints
- Model-based inference in CHARME.
- Integrating operations research in constraint programming
- Core group placement: allocation and provisioning of heterogeneous resources
- A logic language for combinatorial optimization
- MUSCADET: An automatic theorem proving system using knowledge and metaknowledge in mathematics
- Essence: A constraint language for specifying combinatorial problems
- Automated theorem proving in mathematics.
- A generic arc-consistency algorithm and its specializations
- An improved particle swarm optimization algorithm for flowshop scheduling problem
- Tesseral spatio-temporal reasoning for multi-dimensional data
- Tools for reformulating logical forms into zero-one mixed integer programs
- Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction
- Backjump-based backtracking for constraint satisfaction problems
- Integrating operations research in constraint programming
- Constraint satisfaction using constraint logic programming
This page was built for publication: A language and a program for stating and solving combinatorial problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1245009)
