Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs
type: Item
instance of: scholarly article
title: Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs
zbMATH Open document ID: 1392.90085
author: Lluís-Miquel Munguía
author: S. Ahmed
author: David A. Bader
author: Yufen Shao
author: G. L. Nemhauser
published in: Computational Optimization and Applications
publication date: 2018-02-06T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6834702
zbMATH Keywords: MIPs
zbMATH Keywords: parallel algorithms
zbMATH Keywords: primal heuristics
zbMATH Keywords: LNS
describes a project that uses: UG
describes a project that uses: CPLEX
describes a project that uses: MIPLIB
describes a project that uses: Gurobi
describes a project that uses: MPI/MPICH
describes a project that uses: FEASPUMP
describes a project that uses: ParaSCIP
describes a project that uses: DINS
describes a project that uses: Octane
MaRDI profile type: Publication
full work available at URL: s10589-017-9934-5
OpenAlex ID: W2744708081
cites work: Conflict analysis in mixed integer programming
cites work: Improving the feasibility pump
cites work: Rounding and Propagation Heuristics for Mixed Integer Programming
cites work: General purpose heuristics for integer programming. II
cites work: Using the analytic center in the feasibility pump
cites work: Octane: A New Heuristic for Pure 0–1 Programs
cites work: Pivot and shift -- a mixed integer programming heuristic
cites work: A feasibility pump heuristic for general mixed-integer problems
cites work: General purpose heuristics for integer programming. I
cites work: Measuring the impact of primal heuristics
cites work: RENS. The optimal rounding
cites work: Shift-and-propagate
cites work: ZI round, a MIP rounding heuristic
cites work: Boosting the feasibility pump
cites work: Using diversification, communication and parallelism to solve mixed-integer linear programs
cites work: Improving branch-and-cut performance by random sampling
cites work: Exploring relaxation induced neighborhoods to improve MIP solutions
cites work: The feasibility pump
cites work: Local branching
cites work: Repairing MIP infeasibility through local branching
cites work: On the knapsack closure of 0-1 integer linear programs
cites work: Proximity search for 0--1 mixed-integer convex programming
cites work: Feasibility pump 2.0
cites work: DINS, a MIP Improvement Heuristic
cites work: A high-performance, portable implementation of the MPI message passing interface standard
cites work: Variable neighborhood search and local branching
cites work: Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem
cites work: Generation of feasible integer solutions on a massively parallel computer using the feasibility pump
cites work: Could we use a million cores to solve an integer program?
cites work: A parallel local search framework for the fixed-charge multicommodity network flow problem
cites work: Recursive central rounding for mixed integer programs
cites work: An evolutionary algorithm for polishing mixed integer programming solutions
DOI: 10.1007/S10589-017-9934-5
description: scientific article; zbMATH DE number 6834702