New constructs for the description of combinatorial optimization problems in algebraic modeling languages

DOI10.1007/BF00248011zbMath0852.90114MaRDI QIDQ1918922

Robert Fourer, J. J. Bisschop

Publication date: 23 July 1996

Published in: Computational Optimization and Applications (Search for Journal in Brave)

zbMATH Keywords

branch-and-bound; algebraic modeling language; discrete optimization; implicit enumeration; subset enumeration

Mathematics Subject Classification ID

90C10: Integer programming

90C27: Combinatorial optimization

68N15: Theory of programming languages

Related Items

Algebraic languages for mathematical programming, Tools for reformulating logical forms into zero-one mixed integer programs

Uses Software

• AMPL
• CPLEX
• LINDO
• MINTO
• AIMMS
• LINGO
• GAMS
• MODLER

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