Keyword: programming: branch and bound

Found 862 papers in total
Concavity cuts for disjoint bilinear programming
Concavity cuts for disjoint bilinear programming
2001,
We pursue the study of concavity cuts for the disjoint bilinear programming problem....
Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
2001,
Many optimization problems have several equivalent mathematical models. It is often...
A branch-and-bound algorithm for permutation flow shops with sequence-dependent setup times
A branch-and-bound algorithm for permutation flow shops with sequence-dependent setup times
1999,
This paper presents a branch-and-bound enumeration scheme for the makespan...
Design of a flexible assembly line to minimize equipment cost
Design of a flexible assembly line to minimize equipment cost
2000,
In this paper we develop an optimal and a heuristic algorithm for the problem of...
The discrete time/resource trade-off problem in project networks: A branch-and-bound approach
The discrete time/resource trade-off problem in project networks: A branch-and-bound approach
2000,
In many solution methods for resource-constrained project scheduling, it is assumed...
A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops
A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops
1998,
We present and compare a number of branch and bound algorithms for minimizing the...
Note on an improved branch-and-bound algorithm to solve n/m/P/Fmax problems
Note on an improved branch-and-bound algorithm to solve n/m/P/Fmax problems
1999,
The LOMNICKI algorithm for n/m/P/F max flow-shop problems is unsuitable for large...
A hybrid tabu search/branch-and-bound algorithm for the direct flight network design problem
A hybrid tabu search/branch-and-bound algorithm for the direct flight network design problem
2000,
This paper introduces a network design problem with a structure that is encountered in...
Exact solution of multicommodity flow problems with branch-and-bound and column generation
Exact solution of multicommodity flow problems with branch-and-bound and column generation
2001,
We present a branch-and-price algorithm to solve the minimum cost multicommodity flow...
Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints
Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints
2001,
We will propose a branch and bound algorithm for calculating a globally optimal...
Designing group technology manufacturing systems using heuristics branching rules
Designing group technology manufacturing systems using heuristics branching rules
2001,
Group technology (GT) has been proposed to increase productivity in manufacturing. The...
An enhanced rostering model for airline crews
An enhanced rostering model for airline crews
2001,
This paper introduces an efficient adaptation of the branch-and-bound technique that...
A parallel branch-and-bound method for cluster analysis
A parallel branch-and-bound method for cluster analysis
1999,
Cluster analysis is a generic term coined for procedures that are used objectively to...
A parallel algorithm for the global minimization of Gibbs free energy
A parallel algorithm for the global minimization of Gibbs free energy
1999,
A chemical mixture under conditions of constant temperature and pressure may split...
Improved methods of assembly sequence determination for automatic assembly systems
Improved methods of assembly sequence determination for automatic assembly systems
2001,
The assembly sequence is determined using product unit cost as the performance...
On an assignment problem with side constraints
On an assignment problem with side constraints
1999,
We describe a branch and bound algorithm for an assignment problem subject to a...
Solving large single allocation p-hub problems with two or three hubs
Solving large single allocation p-hub problems with two or three hubs
2001,
In this paper we present an efficient approach for solving single allocation p -hub...
Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs
Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs
1999,
This paper develops a branch and bound algorithm for solving the single-machine...
A new heuristic and dominance relations for no-wait flowshops with setups
A new heuristic and dominance relations for no-wait flowshops with setups
2001,
The two-machine no-wait flowshop problem, where setup times are considered separate...
Single machine weighted earliness–tardiness penalty problem with a common due date
Single machine weighted earliness–tardiness penalty problem with a common due date
2001,
In this paper, we have considered a class of single machine job scheduling problems...
Minimizing the expected total value of shortages for a population of items subject to practical restrictions on the reorder points
Minimizing the expected total value of shortages for a population of items subject to practical restrictions on the reorder points
2001,
We address a problem of setting reorder points (expressed as time supplies) of a...
An algorithm for the capacitated, multi-commodity multi-period facility location problem
An algorithm for the capacitated, multi-commodity multi-period facility location problem
2001,
There are substantial number of exact and heuristic solution methods proposed for...
Disassembly sequence plan generation using a branch-and-bound algorithm
Disassembly sequence plan generation using a branch-and-bound algorithm
2001,
This paper presents an approach to generate disassembly sequence plans (DSP)...
A branch-and-bound algorithm for the resource-constrained project scheduling problem
A branch-and-bound algorithm for the resource-constrained project scheduling problem
2000,
We describe a time-oriented branch-and-bound algorithm for the resource-constrained...
Papers per page: