A proposal for a hybrid meta-strategy for combinatorial optimization problems

DOI10.1007/s10732-007-9056-9zbMath1151.90524OpenAlexW2171216849MaRDI QIDQ945052

Jose M. Framinan, Rafael Pastor

Publication date: 10 September 2008

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

Full work available at URL: https://idus.us.es/handle//11441/103020

zbMATH Keywords

optimizationbranch and boundmeta-heuristics

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (3)

An effective matheuristic for the capacitated total quantity discount problem ⋮ A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation ⋮ Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A genetic algorithm for flowshop sequencing
• Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization
• A comprehensive review and evaluation of permutation flowshop heuristics
• A computational study of the permutation flow shop problem based on a tight lower bound
• A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
• A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem
• Benchmarks for basic scheduling problems
• An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A branch-and-bound-based local search method for the flow shop problem
• Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
• Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems

This page was built for publication: A proposal for a hybrid meta-strategy for combinatorial optimization problems