Improving branch-and-cut performance by random sampling

DOI10.1007/s12532-015-0096-0zbMath1334.90079OpenAlexW2270533177MaRDI QIDQ266414

Matteo Fischetti, Michele Monaci, Andrea Tramontani, Andrea Lodi, Domenico Salvagnin

Publication date: 13 April 2016

Published in: Mathematical Programming Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12532-015-0096-0

zbMATH Keywords

integer programmingperformance variability

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (10)

Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining ⋮ Exact approaches for the knapsack problem with setups ⋮ On learning and branching: a survey ⋮ Cutting plane selection with analytic centers and multiregression ⋮ A data driven Dantzig-Wolfe decomposition framework ⋮ On the generation of metric TSP instances with a large integrality gap by branch-and-cut ⋮ An exploratory computational analysis of dual degeneracy in mixed-integer programming ⋮ Generation of feasible integer solutions on a massively parallel computer using the feasibility pump ⋮ Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs ⋮ Parallelization of the FICO Xpress-Optimizer

Uses Software

• SCIP
• MIPLIB
• CPLEX
• Gurobi
• FEASPUMP
• XPRESS
• ParaSCIP
• MIPLIB2003

Cites Work

• Unnamed Item
• Valid inequalities for mixed integer linear programs
• A distributed processing algorithm for solving integer programs using a cluster of workstations
• Using diversification, communication and parallelism to solve mixed-integer linear programs
• Measuring the impact of primal heuristics
• Conflict analysis in mixed integer programming
• The feasibility pump
• Mixed Integer Programming Computation
• Exploiting Erraticism in Search
• Mixed Integer Programming: Analyzing 12 Years of Progress

This page was built for publication: Improving branch-and-cut performance by random sampling