Computer Codes for Problems of Integer Programming

DOI10.1016/S0167-5060(08)70352-2zbMath0428.90048OpenAlexW1600578371MaRDI QIDQ3865843

Susan Powell, Ailsa Land

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)

Related Items

A branch and bound algorithm for extreme point mathematical programming problems, Branching rules revisited, A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints, S3 sets. An extension of the Beale-Tomlin special ordered sets, A possible way to reduce degeneracy in integer programming computations, Strategies for LP-based solving a general class of scheduling problems, Cost minimization of m simultaneous projects that require the same scarce resource, A theoretical and computational analysis of full strong-branching, 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), Learning Bayesian network structure: towards the essential graph by integer linear programming tools, Polyhedral approaches to learning Bayesian networks, Classical cuts for mixed-integer programming and branch-and-cut, Rail platooning: scheduling trains along a rail corridor with rapid-shunting facilities, A survey of the operational use of ILP models, SCIP: solving constraint integer programs, Efficient semidefinite branch-and-cut for MAP-MRF inference, A comparative analysis of linear fitting for non-linear functions on optimization. A case study: Air pollution problems, A note on modeling multiple choice requirements for simple mixed integer programming solvers, Implementations of special ordered sets in MP software, Solving integer programs with a few important binary gub constraints, Capital budgeting with Benders' decomposition, Branch and bound with estimation based on pseudo-shadow-prices, Integer-programming software systems