A language and a program for stating and solving combinatorial problems
From MaRDI portal
Publication:1245009
DOI10.1016/0004-3702(78)90029-2zbMath0374.68060OpenAlexW2002597376WikidataQ56031619 ScholiaQ56031619MaRDI QIDQ1245009
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
Integer programming (90C10) Pattern recognition, speech recognition (68T10) Mathematical programming (90Cxx) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items
Constraint programming and operations research, Intruder alert! Optimization models for solving the mobile robot graph-clear problem, Model-based inference in CHARME., Tractability-preserving transformations of global cost functions, Undirected forest constraints, Automated theorem proving in mathematics., Combining Two Structured Domains for Modeling Various Graph Matching Problems, MUSCADET: An automatic theorem proving system using knowledge and metaknowledge in mathematics, New constructs for the description of combinatorial optimization problems in algebraic modeling languages, Propositional calculus problems in CHIP, Computing a lower approximation of the compulsory part of a task with varying duration and varying resource consumption., A new order relation on fuzzy soft sets and its application, A logic language for combinatorial optimization, Improved filtering for weighted circuit constraints, Using dual presolving reductions to reformulate cumulative constraints, The design of the zinc modelling language, Essence: A constraint language for specifying combinatorial problems, Integrating operations research in constraint programming, Interval propagation to reason about sets: Definition and implementation of a practical language, Integrating operations research in constraint programming, A generic arc-consistency algorithm and its specializations, Constraint satisfaction using constraint logic programming, An improved particle swarm optimization algorithm for flowshop scheduling problem, A constraint programming primer, Core group placement: allocation and provisioning of heterogeneous resources, Tesseral spatio-temporal reasoning for multi-dimensional data, Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction, A linear and discrete programming framework for representing qualitative knowledge, Tools for reformulating logical forms into zero-one mixed integer programs, Backjump-based backtracking for constraint satisfaction problems
Cites Work
- Planning in a hierarchy of abstraction spaces
- An Automatic Method of Solving Discrete Programming Problems
- An algorithm for the 0/1 Knapsack problem
- Branch-and-Bound Methods: A Survey
- A technique for colouring a graph applicable to large scale timetabling problems
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
