New constructs for the description of combinatorial optimization problems in algebraic modeling languages
From MaRDI portal
Publication:1918922
DOI10.1007/BF00248011zbMath0852.90114MaRDI QIDQ1918922
Publication date: 23 July 1996
Published in: Computational Optimization and Applications (Search for Journal in Brave)
branch-and-boundalgebraic modeling languagediscrete optimizationimplicit enumerationsubset enumeration
Integer programming (90C10) Combinatorial optimization (90C27) Theory of programming languages (68N15)
Related Items (2)
Algebraic languages for mathematical programming ⋮ Tools for reformulating logical forms into zero-one mixed integer programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Modeling Language for Mathematical Programming
- Extension of GAMS for complementarity problems arising in applied economic analysis
- Modeling by object-driven linear elemental relations: A user's guide for MODLER. Disk included
- A logic language for combinatorial optimization
- A language and a program for stating and solving combinatorial problems
- Logic cuts for processing networks with fixed charges
- Tools for reformulating logical forms into zero-one mixed integer programs
- MINTO, a Mixed INTeger Optimizer
- A graphical interface for production and transportation system modeling: PTS
- Implicit Treatment of “Zero or Range” Constraints in a Model for Minimum Cost Foundry Alloys
- An Introduction to Graph-Based Modeling Systems, Part II: Graph-Grammars and the Implementation
- A Computational Study of Satisfiability Algorithms for Propositional Logic
- Expressing Special Structures in an Algebraic Modeling Language for Mathematical Programming
- Solving large combinatorial problems in logic programming
This page was built for publication: New constructs for the description of combinatorial optimization problems in algebraic modeling languages
