Keyword: programming: branch and bound

Found 862 papers in total
Combination between global and local methods for solving an optimization problem over the efficient set
Combination between global and local methods for solving an optimization problem over the efficient set
2002,
In this paper, we propose an algorithm for globally solving optimization problems over...
Algorithms for a facility location problem with stochastic customer demand and immobile servers
Algorithms for a facility location problem with stochastic customer demand and immobile servers
2002,
This paper studies a facility location problem with stochastic customer demand and...
The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
2002,
The transportation problem with exclusionary side constraints, a practical...
Managing resource allocation, scheduling and simulation for an intermodal container terminal
Managing resource allocation, scheduling and simulation for an intermodal container terminal
2000,
An intermodal container terminal is a complex system that manages the process of...
Discrete time/cost trade-offs in project scheduling with time-switch constraints
Discrete time/cost trade-offs in project scheduling with time-switch constraints
2002,
The discrete time/cost trade-off problem assumes the duration of project activities to...
A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems
A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems
2002,
The m -machine permutation flowshop problem with the total flow-time objective is a...
Comparing an ant colony optimization algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times
Comparing an ant colony optimization algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times
2002,
We compare several heuristics for solving a single machine scheduling problem. In the...
No-wait flowshops with bicriteria of makespan and total completion time
No-wait flowshops with bicriteria of makespan and total completion time
2002,
We consider the m -machine no-wait flowshop scheduling problem with the objective of...
Analysis and algorithms for the transtainer routing problem in container port operations
Analysis and algorithms for the transtainer routing problem in container port operations
2002,
The problem of minimizing the time taken to load the containers from the container...
Using the branch and bound algorithm to solve forest planning problems with adjacency constraints
Using the branch and bound algorithm to solve forest planning problems with adjacency constraints
2001,
This article describes an assessment of the branch and bound algorithm (BBA) for...
A branch-and-bound combinatorial approach to level of repair analysis
A branch-and-bound combinatorial approach to level of repair analysis
2001,
This paper proposes a combinatorial approach for level of repair analysis which is...
Program does not equal program: Constraint programming and its relationship to mathematical programming
Program does not equal program: Constraint programming and its relationship to mathematical programming
2001,
Arising from research in the computer science community, constraint programming is a...
A branch and bound algorithm for designing reliable systems at a minimum cost
A branch and bound algorithm for designing reliable systems at a minimum cost
2001,
A nonlinear integer programming model for the optimal design of a series/parallel...
A branch and bound algorithm for computing optimal replacement policies in consecutive k-out-of-n-systems
A branch and bound algorithm for computing optimal replacement policies in consecutive k-out-of-n-systems
2002,
This paper presents a branch and bound algorithm for computing optimal replacement...
A branch-and-bound approach to the optimization of redundant software under failure correlation
A branch-and-bound approach to the optimization of redundant software under failure correlation
2002,
A technique for computing optimal redundancy levels for the components of a...
Project scheduling under time dependent costs – a branch and bound algorithm
Project scheduling under time dependent costs – a branch and bound algorithm
2001,
In a given project network, execution of each activity in normal duration requires...
The total completion time open shop scheduling problem with a given sequence of jobs on one machine
The total completion time open shop scheduling problem with a given sequence of jobs on one machine
2002,
This paper addresses the open shop scheduling problem to minimize the total completion...
A branch and bound approach to two-stage hybrid flow shop scheduling problem with diverging jobs and time overlapping production
A branch and bound approach to two-stage hybrid flow shop scheduling problem with diverging jobs and time overlapping production
1999,
We consider a two-stage hybrid flow shop scheduling problem minimizing makespan. The...
An operations research approach to the problem of the sugarcane selection
An operations research approach to the problem of the sugarcane selection
2001,
Selection for superior clones is the most important aspect of sugarcane improvement...
Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
2002,
A batch processing machine can simultaneously process several jobs forming a batch....
Minimizing tardiness in a two-machine flow-shop
Minimizing tardiness in a two-machine flow-shop
2002,
The two-machine flow-shop scheduling problem with the objective of minimizing total...
An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
2002,
We consider the two machine total completion time flow shop scheduling problem. This...
A comparison of optimal methods for local access uncapacitated network design
A comparison of optimal methods for local access uncapacitated network design
2001,
We compare some optimal methods addressed to a problem of local access network design....
Optimal base station positioning and channel assignment for third generation mobile networks by integer programming
Optimal base station positioning and channel assignment for third generation mobile networks by integer programming
2001,
In this paper, discrete mathematical programming approaches are used to solve the...
Papers per page: