Generalized resolution search

DOI10.1016/J.DISOPT.2010.08.004zbMATH Open1241.90084OpenAlexW2041745502MaRDI QIDQ429682FDOQ429682

Authors: Marius Posta, Jacques A. Ferland, Philippe Michelon 

Publication date: 20 June 2012

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2010.08.004

Recommendations

• Resolution search and dynamic branch-and-bound
• Resolution search
• Problems of discrete optimization: challenges and main approaches to solve them
• Modified branch-and-bound method for solving a series of problems
• General branch and bound, and its relation to \(A^*\) and \(AO^*\)

zbMATH Keywords

exact search methodsresolution search

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Boolean programming (90C09)

Cites Work

• Multiple Choice Programming (A Procedure for Linear Programming with Zero-One Variables)
• Integer-programming software systems
• A multi-level search strategy for the 0-1 multidimensional knapsack problem
• Resolution search and dynamic branch-and-bound
• Resolution search

Cited In (3)

• \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees
• Title not available (Why is that?)
• Scheduling a Bridge Club (A Case Study in Discrete Optimization)

This page was built for publication: Generalized resolution search

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