Keyword: programming: branch and bound

Found 862 papers in total
Single machine scheduling using dominance relation to minimize earliness subject to ready and due times
Single machine scheduling using dominance relation to minimize earliness subject to ready and due times
1996,
This paper considers a single machine scheduling problem with the constraints of...
Minimizing resource availability costs in time-limited project networks
Minimizing resource availability costs in time-limited project networks
1995,
The paper considers the problem of minimizing renewable resource availabilty costs in...
Characterization and generation of a general class of resource-constrained project scheduling problems
Characterization and generation of a general class of resource-constrained project scheduling problems
1995,
This paper addresses the issue of how to generate problem instances of controlled...
The maximum collection problem with time-dependent rewards
The maximum collection problem with time-dependent rewards
1996,
The authors consider a routing problem where the objective is to maximize the sum of...
An exact method for the linear constraint satisfaction problem: Application to the satisfiability problem
An exact method for the linear constraint satisfaction problem: Application to the satisfiability problem
1994,
This paper presents an improved version-denoted FAST93-of our method FAST which proves...
Minimization of a concave quadratic function subject to box constraints
Minimization of a concave quadratic function subject to box constraints
1994,
The authors introduce a finite algorithm (MINBCQP) for finding a stationary point of a...
A Branch and Bound procedure to minimize Mean Absolute Lateness on a single processor
A Branch and Bound procedure to minimize Mean Absolute Lateness on a single processor
1996,
This paper presents a solution procedure to minimize the Mean Absolute Lateness single...
Bilevel programming applied to the flow shop scheduling problem
Bilevel programming applied to the flow shop scheduling problem
1996,
A two level branch and bound algorithm is developed to solve an altered form of the...
Application of a hybrid genetic algorithm to airline crew scheduling
Application of a hybrid genetic algorithm to airline crew scheduling
1996,
This paper discusses the development and application of a hybrid genetic algorithm to...
The rectilinear distance minisum problem with minimum distance constraints
The rectilinear distance minisum problem with minimum distance constraints
1995,
This paper describes a mathematical model for locating a single facility on a...
A branch and bound algorithm for hoist scheduling of a circuit board production line
A branch and bound algorithm for hoist scheduling of a circuit board production line
1996,
The article studies the scheduling problem of a material handling hoist in a circuit...
A branch-and-bound approach for machine selection in just-in-time manufacturing systems
A branch-and-bound approach for machine selection in just-in-time manufacturing systems
1996,
Equipment selection issues are very important in the early stages of implementation of...
Single machine jobshop scheduling problem with weighted quadratic function of job lateness: A branch-and-bound approach
Single machine jobshop scheduling problem with weighted quadratic function of job lateness: A branch-and-bound approach
1995,
This paper considers minimizing the sum of the weighted squares of lateness values for...
The two-machine flow shop problem with arbitrary precedence relations
The two-machine flow shop problem with arbitrary precedence relations
1993,
The n- job 2-machine flow shop problem with arbitrary precedence constraints is...
A branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs
A branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs
1994,
The authors consider the asymmetric capacitated vehicle routing problem ( CVRP ), a...
Improving the performance of enumerative search methods-Part II: Computational experiments
Improving the performance of enumerative search methods-Part II: Computational experiments
1995,
Generally, branch and bound algorithms typically use mechanistic search strategies and...
Parallel branch-and-bound algorithms: Survey and synthesis
Parallel branch-and-bound algorithms: Survey and synthesis
1994,
The authors present a detailed and up-to-date survey of the literature on parallel...
A hybrid dynamic programming/branch-and-bound algorithm for the multiple-choice kanpsack problem
A hybrid dynamic programming/branch-and-bound algorithm for the multiple-choice kanpsack problem
1995,
Dynamic programming and branch-and-bound methodologies are combined to produce a...
A multicriteria scheduling tool using a branch-and-bound algorithm
A multicriteria scheduling tool using a branch-and-bound algorithm
1992,
This paper is concerned with multicriteria scheduling problems encountered by the...
A branch-and-bound algorithm for depot location and container fleet management
A branch-and-bound algorithm for depot location and container fleet management
1995,
The multicommodity location problem with balancing requirements is related to one of...
Branch-and-bound algorithms for the multi-product assembly line balancing problem
Branch-and-bound algorithms for the multi-product assembly line balancing problem
1992,
This paper considers a flexible manufacturing system for several products, each...
A branch-and-bound approach for a two-machine flowshop scheduling problem
A branch-and-bound approach for a two-machine flowshop scheduling problem
1995,
This paper presents a branch-and-bound approach for solving a two-machine flow shop...
A branch-and-bound approach for sequencing expansion projects
A branch-and-bound approach for sequencing expansion projects
1995,
The paper examines the problem of finding a sequence of a finite set of expansion...
Cellular arrangement problems with random flows
Cellular arrangement problems with random flows
1995,
In VLSI design, manufacturing systems, architectural floorplan generation, urban and...
Papers per page: