Using a Hybrid Genetic-Algorithm/Branch and Bound Approach to Solve Feasibility and Optimization Integer Programming Problems

The satisfiability problem in forms such as maximum satisfiability (MAX-SAT) remains a hard problem. The most successful approaches for solving such problems use a form of systematic tree search. This paper describes the use of a hybrid algorithm, combining genetic algorithms and integer programming...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of heuristics Vol. 7; no. 6; pp. 551 - 564
Main Authors:	French, Alan P., Robinson, Andrew C., Wilson, John M.
Format:	Journal Article
Language:	English
Published:	Boston Springer Nature B.V 01.11.2001
Subjects:	Algorithms Genetic algorithms Heuristic Integer programming Linear programming Mathematical programming Optimization Software Studies Variables
ISSN:	1381-1231, 1572-9397
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!