Computer Codes for Problems of Integer Programming

DOI10.1016/S0167-5060(08)70352-2MaRDI QIDQ3865843zbMATH OpenOpenAlexFDO

Authors Ailsa Land, Susan Powell

Publication date 1979

Published in Discrete Optimization II, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium co-sponsored by IBM Canada and SIAM Banff, Aha. and Vancouver (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-5060(08)70352-2

zbMATH Keywords

mixed integer programmingbranch-and-bound methodcomparison of algorithmsalgorithmic performancebibliography of available computer codescommercial computer codes

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Mixed integer programming (90C11) Specification and verification (program logics, model checking, etc.) (68Q60) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Cited in

(24)

• Classical cuts for mixed-integer programming and branch-and-cut
• S3 sets. An extension of the Beale-Tomlin special ordered sets
• A theoretical and computational analysis of full strong-branching
• A survey of the operational use of ILP models
• A comparative analysis of linear fitting for non-linear functions on optimization. A case study: Air pollution problems
• Strategies for LP-based solving a general class of scheduling problems
• Integer-programming software systems
• Rail platooning: scheduling trains along a rail corridor with rapid-shunting facilities
• A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints
• Branching rules revisited
• A branch and bound algorithm for extreme point mathematical programming problems
• Cost minimization of m simultaneous projects that require the same scarce resource
• Solving integer programs with a few important binary gub constraints
• A note on modeling multiple choice requirements for simple mixed integer programming solvers
• Zur Modellierung logischer Aussagen ergänzend zu Linearen Programmen. Grundlagen und Entwurfsüberlegungen für einen Modellgenerator. (Modelling logical predicates in addition to linear programs. Foundations and design considerations for a model generator)
• A diving heuristic for mixed-integer problems with unbounded semi-continuous variables
• SCIP: solving constraint integer programs
• Efficient semidefinite branch-and-cut for MAP-MRF inference
• Learning Bayesian network structure: towards the essential graph by integer linear programming tools
• Implementations of special ordered sets in MP software
• Capital budgeting with Benders' decomposition
• Branch and bound with estimation based on pseudo-shadow-prices
• Polyhedral approaches to learning Bayesian networks
• A possible way to reduce degeneracy in integer programming computations

This page was built for publication: Computer Codes for Problems of Integer Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3865843)