Inequalities and Target Objectives for Metaheuristic Search – Part I: Mixed Binary Optimization
From MaRDI portal
Publication:3509451
DOI10.1007/978-3-540-72960-0_21zbMath1211.90305OpenAlexW1491854785MaRDI QIDQ3509451
Publication date: 1 July 2008
Published in: Natural Computing Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-72960-0_21
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
Cites Work
- An algorithm for the job shop scheduling problem based on global equilibrium search techniques
- Infeasible/feasible search trajectories and directional rounding in integer programming
- Active-constraint variable ordering for faster feasibility of mixed integer linear programs
- New approaches for heuristic search: A bilateral linkage with artificial intelligence
- Zero-one programming with many variables and few constraints
- A heuristic for Boolean optimization problems
- Foundation-penalty cuts for mixed-integer programs.
- Adaptive memory search for Boolean optimization problems
- New convergent heuristics for 0-1 mixed integer programming
- Parametric tabu-search for mixed integer programs
- The feasibility pump
- Canonical Cuts on the Unit Hypercube
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Inequalities and Target Objectives for Metaheuristic Search – Part I: Mixed Binary Optimization