Exploiting Erraticism in Search

DOI10.1287/opre.2013.1231zbMath1291.90148OpenAlexW2127220062MaRDI QIDQ5166303

Michele Monaci, Matteo Fischetti

Publication date: 26 June 2014

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.2013.1231

zbMATH Keywords

mixed integer programmingrestartenumerative algorithms

Mathematics Subject Classification ID

Mixed integer programming (90C11) Sensitivity, stability, parametric optimization (90C31)

Related Items (24)

Improving branch-and-cut performance by random sampling ⋮ On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations ⋮ On handling indicator constraints in mixed integer programming ⋮ Modeling the parallel machine scheduling problem with step deteriorating jobs ⋮ SelfSplit parallelization for mixed-integer linear programming ⋮ The bi-objective insular traveling salesman problem with maritime and ground transportation costs ⋮ Mixed integer programming models for job shop scheduling: A computational analysis ⋮ Using diversification, communication and parallelism to solve mixed-integer linear programs ⋮ A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem ⋮ On learning and branching: a survey ⋮ Initialization of metaheuristics: comprehensive review, critical analysis, and research directions ⋮ Complexity, algorithmic, and computational aspects of a dial-a-ride type problem ⋮ Novel formulations and modeling enhancements for the dynamic berth allocation problem ⋮ Using a general-purpose mixed-integer linear programming solver for the practical solution of real-time train rescheduling ⋮ Feasibility jump: an LP-free Lagrangian MIP heuristic ⋮ Minimum tiling of a rectangle by squares ⋮ A computational study of primal heuristics inside an MI(NL)P solver ⋮ Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning ⋮ A branch-and-cut algorithm for mixed-integer bilinear programming ⋮ An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron ⋮ An enhanced logical benders approach for linear programs with complementarity constraints ⋮ Hybrid algorithms for placement of virtual machines across geo-separated data centers ⋮ A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning ⋮ Learning to sparsify travelling salesman problem instances

This page was built for publication: Exploiting Erraticism in Search