Keyword: programming: branch and bound

Found 862 papers in total
Locating semi-obnoxious facilities with expropriation: minisum criterion
Locating semi-obnoxious facilities with expropriation: minisum criterion
2007,
This paper considers the problem of locating semi-obnoxious facilities assuming that...
Branch and bound algorithm for the warehouse location problem with the objective function as linear fractional
Branch and bound algorithm for the warehouse location problem with the objective function as linear fractional
2006,
In this paper, a branch and bound algorithm for a special class of warehouse location...
Late work minimization in a small flexible manufacturing system
Late work minimization in a small flexible manufacturing system
2007,
The paper concerns a small flexible manufacturing system consisting of three CNC...
Scheduling on a single machine with family setups to minimize total tardiness
Scheduling on a single machine with family setups to minimize total tardiness
2007,
This paper considers the problem of scheduling on a single machine to minimize total...
Optimal and near-optimal algorithms to rolling batch scheduling for seamless steel tube production
Optimal and near-optimal algorithms to rolling batch scheduling for seamless steel tube production
2007,
Seamless steel tube is one of the major products in iron and steel industries....
Minimizing total tardiness in an unrelated parallel-machine scheduling problem
Minimizing total tardiness in an unrelated parallel-machine scheduling problem
2007,
We consider a problem of scheduling n independent jobs on m unrelated parallel...
An optimization algorithm for the pickup and delivery problem with time windows
An optimization algorithm for the pickup and delivery problem with time windows
2007,
The pickup and delivery problem with time windows generally involves the construction...
A genetic algorithm for the partial binary constraint satisfaction problem: an application to a frequency assignment problem
A genetic algorithm for the partial binary constraint satisfaction problem: an application to a frequency assignment problem
2007,
We describe a genetic algorithm for the partial constraint satisfaction problem. The...
Simplest optimal cutting patterns for equal rectangles
Simplest optimal cutting patterns for equal rectangles
2006,
This paper presents branch-and-bound algorithms that can guarantee the simplest...
Simple block patterns for the two-dimensional cutting problem
Simple block patterns for the two-dimensional cutting problem
2007,
This paper presents an algorithm for the unconstrained two-dimensional cutting problem...
An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
2007,
We present an exact and efficient branch-and-bound algorithm MCR for finding a maximum...
Comparison of deterministic and stochastic approaches to global optimization
Comparison of deterministic and stochastic approaches to global optimization
2005,
In this paper, we compare two different approaches to nonconvex global optimization....
An adaptive branch and bound approach for transforming job shops into flow shops
An adaptive branch and bound approach for transforming job shops into flow shops
2007,
In this paper we address the problem of transforming a job shop layout into a flow...
A bi-criteria two-machine flowshop scheduling problem with a learning effect
A bi-criteria two-machine flowshop scheduling problem with a learning effect
2006,
This paper addresses a bi-criteria two-machine flowshop scheduling problem when the...
Crane scheduling with non-crossing constraint
Crane scheduling with non-crossing constraint
2006,
In this paper, we examine crane scheduling for ports. This important component of port...
Minimizing maximum lateness in a flow shop subject to release dates
Minimizing maximum lateness in a flow shop subject to release dates
2007,
We consider the problem of minimizing the maximum lateness in an m -machine flow shop...
On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times
On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times
2006,
We address the multi-item, capacitated lot-sizing problem (CLSP) encountered in...
Models and algorithms for the screen line-based traffic-counting location problems
Models and algorithms for the screen line-based traffic-counting location problems
2006,
We consider an overlooked, but important, practical problem about the optimal...
Upper bounds and exact algorithms for p-dispersion problems
Upper bounds and exact algorithms for p-dispersion problems
2006,
The p -dispersion-sum problem is the problem of locating p facilities at some of n...
A new branch-and-bound-enhanced genetic algorithm for the manufacturing cell formation problem
A new branch-and-bound-enhanced genetic algorithm for the manufacturing cell formation problem
2006,
This paper deals with the manufacturing cell formation problem, which is based on...
Scheduling two-stage hybrid flow shop with availability constraints
Scheduling two-stage hybrid flow shop with availability constraints
2006,
Most of the literature on scheduling assumes that machines are always available....
Spread time considerations in operational fixed job scheduling
Spread time considerations in operational fixed job scheduling
2006,
In this study, we consider the operational fixed job scheduling problem on identical...
Minimizing flow time in a flow-line manufacturing cell with family setup times
Minimizing flow time in a flow-line manufacturing cell with family setup times
2006,
This paper considers the problem of scheduling part families and jobs within each part...
Minimizing sum of completion times on a single machine with sequence-dependent family setup times
Minimizing sum of completion times on a single machine with sequence-dependent family setup times
2006,
This paper presents a branch-and-bound (B&B) algorithm for minimizing the sum of...
Papers per page: