A language and a program for stating and solving combinatorial problems
From MaRDI portal
(Redirected from Publication:1245009)
Cites work
- scientific article; zbMATH DE number 3480375 (Why is no real title available?)
- scientific article; zbMATH DE number 3501240 (Why is no real title available?)
- scientific article; zbMATH DE number 3510075 (Why is no real title available?)
- scientific article; zbMATH DE number 3554015 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3599490 (Why is no real title available?)
- scientific article; zbMATH DE number 3443590 (Why is no real title available?)
- scientific article; zbMATH DE number 3201933 (Why is no real title available?)
- scientific article; zbMATH DE number 3307136 (Why is no real title available?)
- scientific article; zbMATH DE number 3326187 (Why is no real title available?)
- scientific article; zbMATH DE number 3333906 (Why is no real title available?)
- scientific article; zbMATH DE number 3335677 (Why is no real title available?)
- A technique for colouring a graph applicable to large scale timetabling problems
- An Automatic Method of Solving Discrete Programming Problems
- An algorithm for the 0/1 Knapsack problem
- Branch-and-Bound Methods: A Survey
- Planning in a hierarchy of abstraction spaces
- Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The traveling-salesman problem and minimum spanning trees: Part II
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
- Improved filtering for weighted circuit constraints
- Undirected forest 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
- Tractability-preserving transformations of global cost functions
- Constraint reasoning
- The design of the zinc modelling language
- A linear and discrete programming framework for representing qualitative knowledge
- Combining Two Structured Domains for Modeling Various Graph Matching Problems
- Using dual presolving reductions to reformulate cumulative constraints
- Model-based inference in CHARME.
- 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
- Integrating operations research in constraint programming
- 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
- Backjump-based backtracking for constraint satisfaction problems
- Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction
- Constraint satisfaction using constraint logic programming
- Integrating operations research in constraint 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)
