Infeasible/feasible search trajectories and directional rounding in integer programming
From MaRDI portal
Publication:930155
DOI10.1007/S10732-007-9029-ZzbMATH Open1146.90040OpenAlexW2151695306MaRDI QIDQ930155FDOQ930155
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
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
Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bandwidth Packing: A Tabu Search Approach
- Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
- Parametric tabu-search for mixed integer programs
- Scatter search and star-paths: Beyond the genetic metaphor
Cited In (4)
Uses Software
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)
