Keyword: programming: branch and bound

Found 862 papers in total
Iterative patching and the asymmetric traveling salesman problem
Iterative patching and the asymmetric traveling salesman problem
2006,
Although Branch-and-Bound (BnB) methods are among the most widely used techniques for...
Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems
Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems
2006,
A popular approach when using a genetic algorithm in the solution of constrained...
An improved best-first branch and bound algorithm for unconstrained two-dimensional cutting problems
An improved best-first branch and bound algorithm for unconstrained two-dimensional cutting problems
2005,
In this paper, we develop an improved branch and bound algorithm for the (un)weighted...
The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions
The continuous assignment problem and its application to preemptive and non-preemptive scheduling with irregular cost functions
2004,
This paper focuses on the continuous assignment problem with the eventual aim to solve...
Using a mixed integer programming tool for solving the 0–1 quadratic knapsack problem
Using a mixed integer programming tool for solving the 0–1 quadratic knapsack problem
2004,
In this paper we will consider the 0–1 quadratic knapsack problem (QKP). Our...
A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times
A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times
2006,
In this paper, we address the three-machine flowshop scheduling problem. Setup times...
Bicriteria scheduling in a two-machine permutation flowshop
Bicriteria scheduling in a two-machine permutation flowshop
2006,
In this paper we consider a production scheduling problem in a two-machine flowshop....
State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
2006,
The assembly line balancing problem arises and has to be solved when an assembly line...
Note on minimizing total tardiness in a two-machine flowshop
Note on minimizing total tardiness in a two-machine flowshop
2005,
This note considers the problem of sequencing jobs to minimize total tardiness in a...
Genetic local search for multi-objective flowshop scheduling problems
Genetic local search for multi-objective flowshop scheduling problems
2005,
This paper addresses flowshop scheduling problems with multiple performance criteria...
Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem
Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem
2006,
Despite being strongly NP -hard, the one-machine sequencing problem that minimizes the...
Minimizing total weighted completion time in a two-machine flowshop with sequence-independent setup times
Minimizing total weighted completion time in a two-machine flowshop with sequence-independent setup times
2005,
The two-machine flowshop scheduling problem where set-up times are separated and...
A logistics scheduling model: Inventory cost reduction by batching
A logistics scheduling model: Inventory cost reduction by batching
2005,
Logistics scheduling refers to the problems where the decisions of job scheduling and...
Dynamic optimization of the operation of single-car elevator systems with destination hall call registration: Part II. The solution algorithm
Dynamic optimization of the operation of single-car elevator systems with destination hall call registration: Part II. The solution algorithm
2005,
In this study we consider the elevator operation problem of single-car elevator...
Lower bound improvement and forcing rule for quadratic binary programming
Lower bound improvement and forcing rule for quadratic binary programming
2006,
In this paper several equivalent formulations for the quadratic binary programming...
A branch-and-cut algorithm for the pallet loading problem
A branch-and-cut algorithm for the pallet loading problem
2005,
We propose a branch-and-cut algorithm for the pallet loading problem. The 0–1...
An exact approach to early/tardy scheduling with release dates
An exact approach to early/tardy scheduling with release dates
2005,
In this paper we consider the single machine earliness/tardiness scheduling problem...
A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
2005,
This paper investigates branch-and-bound algorithms for the problem of scheduling jobs...
Parallel branch and cut for capacitated vehicle routing
Parallel branch and cut for capacitated vehicle routing
2003,
Combinatorial optimization problems arise commonly in logistics applications. The most...
Model for cost estimation in a finite-capacity environment
Model for cost estimation in a finite-capacity environment
2006,
Cost estimation is a practical problem that has attracted the attention of many...
Partial convexification cuts for 0–1 mixed-integer programs
Partial convexification cuts for 0–1 mixed-integer programs
2005,
In this research, we propose a new cut generation scheme based on constructing a...
An experimental analysis of solution performance in a resource sharing and scheduling problem
An experimental analysis of solution performance in a resource sharing and scheduling problem
2005,
In this paper we study the performance of a branch and bound enumeration procedure in...
On a fix-and-relax framework for class of project scheduling problems
On a fix-and-relax framework for class of project scheduling problems
2005,
We consider the following problem: Given a set of projects to be executed along a...
A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
2005,
The hybrid or flexible flowshop problem is a generalization of the flowshop in such a...
Papers per page: