Keyword: programming: branch and bound

Found 862 papers in total
Three-stage flow-shop scheduling with assembly operations to minimize the weighted sum of product completion times
2005,
A modified flow-shop scheduling problem for a production system, characterized by...
A branch and bound algorithm for the robust spanning tree problem with interval data
2005,
The robust spanning tree problem is a variation, motivated by telecommunications...
Branch and bound algorithms for the multidimensional assignment problem
2005,
This work investigates two branch and bound algorithms based on different tree...
A branch-and-bound method for solving the problem of finding the min cut with size constraint in a graph
2001,
A branch-and-bound method for solving the min cut with size constraint problem is...
Deterministic global optimization using interval constraint propagation techniques
2004,
The purpose of this article is to show the great interest of the use of propagation...
An exact solution method for reliability optimization in complex systems
2005,
Systems reliability plays an important part in systems design, operation and...
A Branch-and-Bound procedure to minimize total tardiness on one machine with arbitrary release dates
2004,
In this paper, we present a Branch-and-Bound procedure to minimize total tardiness on...
The two-machine flowshop total completion time problem: Improved lower bounds and a branch-and-bound algorithm
2004,
This paper presents a branch-and-bound algorithm for the two-machine flowshop...
Optimal scheduling of the 3-machine assembly-type flow shop
1999,
We address the 3-Machine Assembly-Type Flowshop Scheduling Problem (3MAF). This...
An exact method for solving the multi-processor flow-shop
2000,
The aim of this paper is to present a new branch and bound method for solving the...
A parallel algorithm using both Monte-Carlo and quasi-Monte-Carlo techniques, and an application to queueing networks
2000,
We propose a parallel algorithm which uses both Monte-Carlo and quasi-Monte-Carlo...
Heuristics for the one-commodity pickup-and-delivery traveling salesman problem
2004,
This paper deals with a generalisation of the well-known traveling salesman problem...
Maximal covering code multiplexing access telecommunication networks
2004,
We present a maximal covering model for the network design of code division...
The multidimensional 0–1 knapsack problem: An overview
2004,
The multidimensional 0–1 knapsack problem is one of the most well-known...
Human resources management at a marine container terminal
2004,
We consider the manpower planning problem in the real context of a marine container...
Multi-objective design of team oriented assembly systems
2004,
This paper presents a design methodology for assembly systems based on teams, where...
Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs
2005,
In this paper, we study a scheduling problem of minimizing the total completion time...
Flow-shop scheduling for three serial stations with the last two duplicate
2005,
This paper addresses the problem of scheduling jobs for three serial stations with the...
A crane scheduling method for port container terminals
2004,
This paper discusses the problem of scheduling quay cranes (QCs), the most important...
Supply chain optimization in the pulp mill industry – integer programming models, column generation and novel constraint branches
2004,
We study the supply chain problem of a large international pulp producer with five...
Effective algorithm and heuristic for the generalized assignment problem
2004,
We present new Branch-and-Bound algorithm for the generalized assignment problem. A...
Solving knapsack problems using Divide and Conquer and Branch and Bound methods
2004,
This paper presents the MaLLBa library. This library provides skeletons to solve...
Global optimization issues in multiparametric continuous and mixed-integer optimization problems
2004,
In this paper, a number of theoretical and algorithmic issues concerning the solution...
Papers per page: