Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning
The branch-and-bound (B&B) algorithmic framework has been used successfully to find
exact solutions for a wide array of optimization problems. B&B uses a tree search strategy to …
exact solutions for a wide array of optimization problems. B&B uses a tree search strategy to …
Multi-objective optimization for pavement maintenance and rehabilitation decision-making: A critical review and future directions
W Chen, M Zheng - Automation in construction, 2021 - Elsevier
The next-generation of pavement maintenance and rehabilitation (M&R) decision-making
needs to weigh multiple strategic goals to achieve sustainable development through the …
needs to weigh multiple strategic goals to achieve sustainable development through the …
[BOOK][B] Structured parallel programming: patterns for efficient computation
M McCool, J Reinders, A Robison - 2012 - books.google.com
Structured Parallel Programming offers the simplest way for developers to learn patterns for
high-performance parallel programming. Written by parallel computing experts and industry …
high-performance parallel programming. Written by parallel computing experts and industry …
Service network design in freight transportation
TG Crainic - European journal of operational research, 2000 - Elsevier
Tactical planning of operations is comprised of a set of interrelated decisions that aim to
ensure an optimal allocation and utilization of resources to achieve the economic and …
ensure an optimal allocation and utilization of resources to achieve the economic and …
[PDF][PDF] Branch and bound algorithms-principles and examples
J Clausen - Department of computer science, University of …, 1999 - janders.eecg.toronto.edu
A large number of real-world planning problems called combinatorial optimization problems
share the following properties: They are optimization problems, are easy to state, and have a …
share the following properties: They are optimization problems, are easy to state, and have a …
Efficient subwindow search: A branch and bound framework for object localization
Most successful object recognition systems rely on binary classification, deciding only if an
object is present or not, but not providing information on the actual object location. To …
object is present or not, but not providing information on the actual object location. To …
Mixed integer programming: Analyzing 12 years of progress
T Achterberg, R Wunderling - Facets of combinatorial optimization …, 2013 - Springer
Back in 2001, Bixby et al.(The Sharpest Cut: The Impact of Manfred Padberg and His Work,
pp. 309–325, 2004) provided an analysis of the performance impact of the main mixed …
pp. 309–325, 2004) provided an analysis of the performance impact of the main mixed …
Crew scheduling
C Barnhart, EL Johnson, GL Nemhauser… - … of transportation science, 1999 - Springer
Given a set of jobs and a set of workers, the generic problem we consider is to find a
partition of the jobs into subsets so that each job is contained in exactly one subset, and …
partition of the jobs into subsets so that each job is contained in exactly one subset, and …
A heuristic clustering-based task deployment approach for load balancing using Bayes theorem in cloud environment
Aiming at the current problems that most physical hosts in the cloud data center are so
overloaded that it makes the whole cloud data center'load imbalanced and that existing load …
overloaded that it makes the whole cloud data center'load imbalanced and that existing load …
Long-haul freight transportation
TG Crainic - Handbook of transportation science, 1999 - Springer
Freight transportation is a vital component of the economy. It supports production, trade, and
consumption activities by ensuring the efficient movement and timely availability of raw …
consumption activities by ensuring the efficient movement and timely availability of raw …