Investigation of some branch and bound strategies for the solution of mixed integer linear programs
From MaRDI portal
Publication:5675545
DOI10.1007/BF01584658zbMath0258.90034OpenAlexW2084616826MaRDI QIDQ5675545
Publication date: 1973
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01584658
Related Items
Optimal distributed execution of join queries, Incorporating processor costs in optimizing the distributed execution of join queries, Representability in mixed integer programming. I: Characterization results, Branching rules revisited, Executing join queries in an uncertain distributed environment, Allocating relations in a distributed database system, Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness information, The propagation of updates to relational tables in a distributed database system, A Wide Branching Strategy for the Graph Coloring Problem, Experiments in integer programming, A theoretical and computational analysis of full strong-branching, On the calculation of true and pseudo penalties in multiple choice integer programming, Solving the optimum communication spanning tree problem, A co-operative parallel heuristic for mixed zero--one linear programming: Combining simulated annealing with branch and bound, Faster MIP solutions via new node selection rules, Multi-item dynamic production-distribution planning in process industries with divergent finishing stages, Active-constraint variable ordering for faster feasibility of mixed integer linear programs, Improving strong branching by domain propagation, SCIP: solving constraint integer programs, Efficient semidefinite branch-and-cut for MAP-MRF inference, Evaluating multiple join queries in a distributed database system, Computational comparison on the partitioning strategies in multiple choice integer programming, Future paths for integer programming and links to artificial intelligence, A simple, all primal branch and bound approach to pure and mixed integer binary programs, Integer-programming software systems
Cites Work