Solving hybrid decision-control problems through conflict-directed branch & bound
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.
Main Author: | Krishnan, Raj, 1980- |
---|---|
Other Authors: | Brian C. Williams. |
Format: | Thesis |
Language: | en_US |
Published: |
Massachusetts Institute of Technology
2005
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/28429 |
Similar Items
-
IMPLEMENTATION The branch and bound method for solving The traveling salesman problem with sparse matrix
by: M. P. Revotjuk, et al.
Published: (2019-06-01) -
Solving optimal satisfiability problems through clause-directed A*
by: Ragno, Robert J. (Robert John), 1977-
Published: (2005) -
Solving Quadratic Assignment Problem with Fixed Assignment (QAPFA) using branch and bound approach
by: Syed-Abdullah, Sharifah Shuthairah, et al.
Published: (2018) -
Branch and bound methods for combinatorial problems.
by: Little, John D. C.
Published: (2009) -
Branch and Bound Algorithm for the Traveling Salesman Problem is not a Direct Type Algorithm
by: Aleksandr N. Maksimenko
Published: (2020-03-01)