Infeasible/feasible search trajectories and directional rounding in integer programming

DOI10.1007/S10732-007-9029-ZMaRDI QIDQ930155zbMATH OpenOpenAlexFDO

Authors Fred Glover

Publication date 23 June 2008

Published in Journal of Heuristics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10732-007-9029-z

zbMATH Keywords

adaptive memory

Mathematics Subject Classification ID

Linear programming (90C05) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 1047678
• A feasible rounding approach for mixed-integer optimization problems
• An algorithm of internal feasible directions for linear integer programming
• scientific article; zbMATH DE number 778139
• Detecting infeasibility in infeasible-interior-point methods for optimization
• Following a “Balanced” Trajectory from an Infeasible Point to an Optimal Linear Programming Solution with a Polynomial-Time Algorithm
• Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems
• scientific article; zbMATH DE number 1300325
• scientific article; zbMATH DE number 4087425
• An infeasible interior-point arc-search algorithm for nonlinear constrained optimization

Cites work

• Bandwidth Packing: A Tabu Search Approach
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• scientific article; zbMATH DE number 2209664 (Why is no real title available?)
• Parametric tabu-search for mixed integer programs
• Scatter search and star-paths: Beyond the genetic metaphor
• Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)

Cited in

(5)

• GRASP with evolutionary path-relinking for the capacitated arc routing problem
• Inequalities and Target Objectives for Metaheuristic Search – Part I: Mixed Binary Optimization
• The case for strategic oscillation
• Feasible and infeasible region search for the maximally diverse grouping problem
• A computational study of parametric tabu search for 0-1 mixed integer programs

Describes a project that uses

Uses Software

• Tabu search

This page was built for publication: Infeasible/feasible search trajectories and directional rounding in integer programming

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