Exploiting erraticism in search

DOI10.1287/OPRE.2013.1231MaRDI QIDQ5166303zbMATH OpenOpenAlexFDO

Authors Matteo Fischetti, Michele Monaci

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

enumerative algorithmsmixed integer programmingrestart

Mathematics Subject Classification ID

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

Recommendations

• Inductive Logic Programming
• Improving branch-and-cut performance by random sampling
• Randomised restarted search in ILP
• Use of random search in solving discrete extremal problems
• Information-theoretic approaches to branching in search

Cited in

(27)

• SelfSplit parallelization for mixed-integer linear programming
• The bi-objective insular traveling salesman problem with maritime and ground transportation costs
• Using diversification, communication and parallelism to solve mixed-integer linear programs
• Using a general-purpose mixed-integer linear programming solver for the practical solution of real-time train rescheduling
• Minimum tiling of a rectangle by squares
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
• An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron
• Learning to sparsify travelling salesman problem instances
• A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem
• A branch-and-cut algorithm for mixed-integer bilinear programming
• 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
• On handling indicator constraints in mixed integer programming
• On learning and branching: a survey
• Novel formulations and modeling enhancements for the dynamic berth allocation problem
• 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
• Modeling the parallel machine scheduling problem with step deteriorating jobs
• Mixed integer programming models for job shop scheduling: A computational analysis
• Search with Noisy and Delayed Responses
• Initialization of metaheuristics: comprehensive review, critical analysis, and research directions
• Complexity, algorithmic, and computational aspects of a dial-a-ride type problem
• Feasibility jump: an LP-free Lagrangian MIP heuristic
• Configuring mixed-integer programming solvers for large-scale instances
• A computational study of primal heuristics inside an MI(NL)P solver
• Last fifty years of integer linear programming: a focus on recent practical advances
• An enhanced logical benders approach for linear programs with complementarity constraints

This page was built for publication: Exploiting erraticism in search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166303)