Pages that link to "Item:Q5675545"

The following pages link to Investigation of some branch and bound strategies for the solution of mixed integer linear programs (Q5675545):

Displaying 25 items.

• A co-operative parallel heuristic for mixed zero--one linear programming: Combining simulated annealing with branch and bound (Q707082) (← links)
• SCIP: solving constraint integer programs (Q734351) (← links)
• Integer-programming software systems (Q817202) (← links)
• Improving the efficiency of the branch and bound algorithm for integer programming based on ``flatness'' information (Q858332) (← links)
• Active-constraint variable ordering for faster feasibility of mixed integer linear programs (Q985305) (← links)
• Representability in mixed integer programming. I: Characterization results (Q1089258) (← links)
• Experiments in integer programming (Q1137509) (← links)
• On the calculation of true and pseudo penalties in multiple choice integer programming (Q1183620) (← links)
• Computational comparison on the partitioning strategies in multiple choice integer programming (Q1266577) (← links)
• Optimal distributed execution of join queries (Q1328829) (← links)
• Incorporating processor costs in optimizing the distributed execution of join queries (Q1336868) (← links)
• Efficient semidefinite branch-and-cut for MAP-MRF inference (Q1800052) (← links)
• Evaluating multiple join queries in a distributed database system (Q1804921) (← links)
• Future paths for integer programming and links to artificial intelligence (Q1821034) (← links)
• A simple, all primal branch and bound approach to pure and mixed integer binary programs (Q1835845) (← links)
• Branching rules revisited (Q1886796) (← links)
• Executing join queries in an uncertain distributed environment (Q1900302) (← links)
• Allocating relations in a distributed database system (Q1903394) (← links)
• The propagation of updates to relational tables in a distributed database system (Q1910779) (← links)
• Solving the optimum communication spanning tree problem (Q1991267) (← links)
• Faster MIP solutions via new node selection rules (Q2270439) (← links)
• Multi-item dynamic production-distribution planning in process industries with divergent finishing stages (Q2496061) (← links)
• Improving strong branching by domain propagation (Q2513744) (← links)
• A Wide Branching Strategy for the Graph Coloring Problem (Q2940061) (← links)
• A theoretical and computational analysis of full strong-branching (Q6126652) (← links)