Keyword: programming: branch and bound

Found 862 papers in total
A multistage stochastic programming approach for capital budgeting problems under uncertainty
A multistage stochastic programming approach for capital budgeting problems under uncertainty
2013,
This paper addresses the capital budgeting problem under uncertainty. In particular,...
New exact method for large asymmetric distance‐constrained vehicle routing problem
New exact method for large asymmetric distance‐constrained vehicle routing problem
2013,
In this paper we revise and modify an old branch‐and‐bound method for...
A distance‐based point‐reassignment heuristic for the k‐hyperplane clustering problem
A distance‐based point‐reassignment heuristic for the k‐hyperplane clustering problem
2013,
We consider the k ‐Hyperplane Clustering problem where, given a set of m points...
Preserving an aging transit fleet: An optimal resource allocation perspective based on service life and constrained budget
Preserving an aging transit fleet: An optimal resource allocation perspective based on service life and constrained budget
2013,
Local, county and state level transit agencies with large fleets of buses and limited...
Branch‐and‐bound algorithms for the partial inverse mixed integer linear programming problem
Branch‐and‐bound algorithms for the partial inverse mixed integer linear programming problem
2013,
This paper presents branch‐and‐bound algorithms for the partial inverse...
Exact algorithms for inventory constrained scheduling on a single machine
Exact algorithms for inventory constrained scheduling on a single machine
2013,
This paper focuses on single machine scheduling subject to inventory constraints. Jobs...
Fast minimum float computation in activity networks under interval uncertainty
Fast minimum float computation in activity networks under interval uncertainty
2013,
This paper concerns project scheduling under uncertainty. The project is modeled as an...
Modeling the budget‐constrained dynamic uncapacitated facility location–network design problem and solving it via two efficient heuristics: A case study of health care
Modeling the budget‐constrained dynamic uncapacitated facility location–network design problem and solving it via two efficient heuristics: A case study of health care
2013,
This paper presents a model for the budget‐constrained dynamic...
An Exact Method for Solving the Multi‐Processor Flow‐Shop
An Exact Method for Solving the Multi‐Processor Flow‐Shop
2000,
The aim of this paper is to present a new branch and bound method for solving the...
Branch‐and‐bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
Branch‐and‐bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
2012,
This paper deals with the parallel‐machine scheduling problem with the aim of...
Parallel branch‐and‐bound and parallel PSO algorithms for job shop scheduling problem with blocking
Parallel branch‐and‐bound and parallel PSO algorithms for job shop scheduling problem with blocking
2013,
In this paper, we deal with the resolution of the scheduling problem with blocking...
A new Branch and Bound method for a discrete truss topology design problem
A new Branch and Bound method for a discrete truss topology design problem
2013,
Our paper considers a classic problem in the field of Truss Topology Design, the goal...
An extension of branch‐and‐bound algorithm for solving sum‐of‐nonlinear‐ratios problem
An extension of branch‐and‐bound algorithm for solving sum‐of‐nonlinear‐ratios problem
2012,
This paper is concerned with a problem of maximizing the sum of several ratios of...
Globally solving a nonlinear UAV task assignment problem by stochastic and deterministic optimization approaches
Globally solving a nonlinear UAV task assignment problem by stochastic and deterministic optimization approaches
2012,
In this paper, we consider a task allocation model that consists of assigning a set of...
A BB&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times
A BB&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times
2012,
This paper presents a Branch, Bound, and Remember (BB&R) exact algorithm using the...
A Simple but Usually Fast Branch‐and‐Bound Algorithm for the Capacitated Facility Location Problem
A Simple but Usually Fast Branch‐and‐Bound Algorithm for the Capacitated Facility Location Problem
2012,
This paper presents a simple branch‐and‐bound method based on Lagrangean...
Semidefinite Programming Based Algorithms for the Sparsest Cut Problem
Semidefinite Programming Based Algorithms for the Sparsest Cut Problem
2011,
In this paper we analyze a known relaxation for the Sparsest Cut problem based on...
Strategic competitive location: improving existing and establishing new facilities
Strategic competitive location: improving existing and establishing new facilities
2012,
Competitive facility location models consider two main strategies for increasing the...
Fixed or variable demand? Does it matter when locating a facility?
Fixed or variable demand? Does it matter when locating a facility?
2012,
In most competitive location models available in the literature, it is assumed that...
A branch‐and‐bound algorithm for the minimum cut linear arrangement problem
A branch‐and‐bound algorithm for the minimum cut linear arrangement problem
2012,
Given an edge‐weighted graph G of order n , the minimum cut linear arrangement...
Parallel branch and bound for multidimensional scaling with city‐block distances
Parallel branch and bound for multidimensional scaling with city‐block distances
2012,
Multidimensional scaling is a technique for exploratory analysis of multidimensional...
Scheduling linear deteriorating jobs to minimize the number of tardy jobs
Scheduling linear deteriorating jobs to minimize the number of tardy jobs
2012,
In this paper a problem of scheduling a single machine under linear deterioration...
Optimal inter‐area coordination of train rescheduling decisions
Optimal inter‐area coordination of train rescheduling decisions
2012,
Railway dispatchers reschedule trains in real‐time in order to limit the...
A branch and bound and parallel genetic algorithm for the job shop scheduling problem with blocking
A branch and bound and parallel genetic algorithm for the job shop scheduling problem with blocking
2012,
In this paper, we study the job shop scheduling problem with blocking where the...
Papers per page: