Keyword: programming: branch and bound

Found 862 papers in total
Fleet assignment and routing with schedule synchronization constraints
Fleet assignment and routing with schedule synchronization constraints
1999,
This paper introduces a new type of constraints, related to schedule synchronization,...
Methods for the sequencing of sheet metal bending operations
Methods for the sequencing of sheet metal bending operations
1999,
The sequencing of part set-ups, in the context of design verification or process...
A branch-first, cut-second approach for locomotive assignment
A branch-first, cut-second approach for locomotive assignment
1999,
The problem of assigning locomotives to trains consists of selecting the types and...
Algorithms for a multi-level network optimization problem
Algorithms for a multi-level network optimization problem
1999,
In this paper we work on a multi-level network optimization problem that integrates...
Solving the minimum weighted integer coloring problem
Solving the minimum weighted integer coloring problem
1998,
In this paper, we present, as far as we are aware of, the first combinatorial...
Maximizing a concave function over the efficient or weakly-efficient set
Maximizing a concave function over the efficient or weakly-efficient set
1999,
An important approach in multiple criteria linear programming is the optimization of...
On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem
On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem
1999,
One of the major strengths of Constraint Programming is the flexibility and...
Dynamic programming and strong bounds for the 0–1 knapsack problem
Dynamic programming and strong bounds for the 0–1 knapsack problem
1999,
Two new algorithms recently proved to outperform all previous methods for the exact...
Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound
Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound
1999,
A stochastic branch-and-bound technique for the solution of stochastic...
The maximum capture problem with heterogeneous customers
The maximum capture problem with heterogeneous customers
1999,
A product is sold in a geographical market and it is provided by different companies....
A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
1999,
This paper addresses the problem of scheduling a given set of independent jobs on a...
A new branch-and-bound approach for the n/2/flowshop/αF + βCmax flowshop scheduling problem
A new branch-and-bound approach for the n/2/flowshop/αF + βCmax flowshop scheduling problem
1999,
In this study, a special situation involving a computationally difficult flowshop...
A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
1999,
We propose a column generation based exact decomposition algorithm for the problem of...
Project scheduling under partially renewable resource constraints
Project scheduling under partially renewable resource constraints
1999,
We consider a generalization of the classical resource constrained project scheduling...
A polyhedral approach to single-machine scheduling problems
A polyhedral approach to single-machine scheduling problems
1999,
We report new results for a time-indexed formulation of nonpreemptive single-machine...
On semi-active timetabling in resource-constrained project scheduling
On semi-active timetabling in resource-constrained project scheduling
1999,
The purpose of this note is to demonstrate that the branch-and-bound algorithm...
On the selection of hub airports for an airline hub-and-spoke system
On the selection of hub airports for an airline hub-and-spoke system
1999,
We consider the 1-stop multiple allocation p -hub median problem. We formulate the...
A branch-and-cut algorithm for capacitated network design problems
A branch-and-cut algorithm for capacitated network design problems
1999,
We present a branch-and-cut algorithm to solve capacitated network design problems....
Exact solution methods for uncapacitated location problems with convex transportation costs
Exact solution methods for uncapacitated location problems with convex transportation costs
1999,
In this paper we study exact solution methods for uncapacitated facility location...
A branch and bound algorithm for locating input and output points of departments on the block layout
A branch and bound algorithm for locating input and output points of departments on the block layout
1999,
We consider the problem of locating input and output (I/O) points of each department...
An exact algorithm for the capacitated facility location problems with single sourcing
An exact algorithm for the capacitated facility location problems with single sourcing
1999,
Facility location problems are often encountered in many areas such as distribution,...
Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type
Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type
1999,
This paper presents exact and heuristic solution procedures for a multiproduct...
A competitive branch-and-bound algorithm for the simple assembly line balancing problem
A competitive branch-and-bound algorithm for the simple assembly line balancing problem
1999,
In this paper we present a branch-and-bound algorithm for solving the simple assembly...
Optimization models for complex recovery block schemes
Optimization models for complex recovery block schemes
1999,
In this paper we consider three complex recovery block schemes: (1) nested recovery...
Papers per page: