Keyword: programming: branch and bound

Found 862 papers in total
The bottleneck generalized assignment problem
The bottleneck generalized assignment problem
1995,
The min–max version of the generalized assignment problem is considered. We...
A note on exact algorithms for the bottleneck generalized assignment problem
A note on exact algorithms for the bottleneck generalized assignment problem
1995,
We give a computational comparison between the algorithms of Mazzola–Neebe and...
A production control system for cellular manufacturing. Part II: Ordering system and operations scheduling
A production control system for cellular manufacturing. Part II: Ordering system and operations scheduling
1996,
This paper, along with Part I (‘A decision support system for elaborating the...
Adjustment of heads and tails for the job-shop problem
Adjustment of heads and tails for the job-shop problem
1994,
The efficiency of recent enumerative methods for the job-shop problem crucially...
A branch and bound procedure for the resource constrained project scheduling problem with discounted cash flows
A branch and bound procedure for the resource constrained project scheduling problem with discounted cash flows
1996,
Management of projects is complicated by the scarcity of resources required to execute...
BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
1997,
In this paper, we consider the well-known one-dimensional bin packing problem (BPP-1),...
An algorithm for the planar three-index assignment problem
An algorithm for the planar three-index assignment problem
1994,
A branch and bound algorithm for the planar three-index assignment problem is...
A computational comparison of branch and bound and outer approximation algorithms for 0–1 mixed integer nonlinear programs
A computational comparison of branch and bound and outer approximation algorithms for 0–1 mixed integer nonlinear programs
1997,
In this paper we compare the performance of two codes for convex 0–1 mixed...
Computational study of a family of mixed-integer quadratic programming problems
Computational study of a family of mixed-integer quadratic programming problems
1996,
We present computational experience with a branch-and-cut algorithm to solve quadratic...
An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks
An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks
1997,
Given a rooted tree T with node profits and node demands, the capacitated subtree of a...
A dual ascent procedure for multiproduct dynamic demand coordinated replenishment with backlogging
A dual ascent procedure for multiproduct dynamic demand coordinated replenishment with backlogging
1996,
This paper describes a mixed-integer programming formulation and dual ascent based...
A branch-and-bound algorithm for the transportation problem with location of p transshipment points
A branch-and-bound algorithm for the transportation problem with location of p transshipment points
1997,
A transshipment-related problem is considered. This problem involves a system with a...
A parallel branch-and-bound algorithm for multicommodity location with balancing requirements
A parallel branch-and-bound algorithm for multicommodity location with balancing requirements
1997,
This article presents a parallel branch-and-bound algorithm for solving the...
Single-machine scheduling with release dates, due dates and family setup times
Single-machine scheduling with release dates, due dates and family setup times
1996,
We address the NP-hard problem of scheduling n independent jobs with release dates,...
The log bucking problem: A comparison of dynamic programming versus branch and bound
The log bucking problem: A comparison of dynamic programming versus branch and bound
1994,
Branch and bound and dynamic programming are often alternative techniques used to...
A branch & bound method for the general-shop problem with sequence dependent setup-times
A branch & bound method for the general-shop problem with sequence dependent setup-times
1996,
A branch & bound algorithm is presented for a very general scheduling problem with...
A binary integer linear program with multi-criteria and multi-constraint levels
A binary integer linear program with multi-criteria and multi-constraint levels
1997,
This paper introduces a mathematical formulation of a binary integer linear program...
Designing a single-vehicle automated guided vehicle system with multiple load capacity
Designing a single-vehicle automated guided vehicle system with multiple load capacity
1996,
Automated guided vehicle systems (AGVSs) play an important role in today’s...
Experience with a cutting plane algorithm for the capacitated spanning tree problem
Experience with a cutting plane algorithm for the capacitated spanning tree problem
1996,
A basic problem in telecommunications network design is that of designing a...
A study on the solution method of maximum origin-destination flow path in an acyclic network using branch and bound method
A study on the solution method of maximum origin-destination flow path in an acyclic network using branch and bound method
1995,
The Maximum Origin-Destination Flow Path Problem (MODFP) in an Acyclic Network is...
A multi-KP modeling for the maximum-clique problem
A multi-KP modeling for the maximum-clique problem
1994,
In this paper the problem of finding the maximum clique of an arbitrary graph G=(X,A)...
Group scheduling on two cells with intercell movement
Group scheduling on two cells with intercell movement
1996,
A set of jobs needs to be processed in a GT/CM system, which consists of two cells...
A branch-and-bound algorithm for single-machine earliness-tardiness scheduling with idle time
A branch-and-bound algorithm for single-machine earliness-tardiness scheduling with idle time
1996,
The authors address the NP-hard single-machine problem of scheduling n independent...
A combined branch-and-bound and genetic algorithm based approach for a flowshop scheduling problem
A combined branch-and-bound and genetic algorithm based approach for a flowshop scheduling problem
1996,
In this paper, the authors study the application of a meta-heuristic to a two-machine...
Papers per page: