Keyword: programming: branch and bound

Found 862 papers in total
The application of valid inequalities to the multi-stage lot-sizing problem
The application of valid inequalities to the multi-stage lot-sizing problem
1995,
A capacitated multi-stage lot-sizing problem for general production structures with...
Improving the performance of enumerative search methods-I. Exploiting structure and intelligence
Improving the performance of enumerative search methods-I. Exploiting structure and intelligence
1995,
Generally, branch and bound algorithms typically use mechanistic search strategies and...
A branch and bound algorithm for solving separable convex integer programming problems
A branch and bound algorithm for solving separable convex integer programming problems
1994,
This paper proposes a branch and bound method that solves a class of nonlinear integer...
A monotonic, dual-based bounding procedure for integer programs
A monotonic, dual-based bounding procedure for integer programs
1995,
This paper develops a simple, dual-based, and monotonic bounding procedure for solving...
MINTO, a Mixed INTeger Optimizer
MINTO, a Mixed INTeger Optimizer
1994,
MINTO is a software system that solves mixed-integer linear programs by a...
A branch and bound procedure for setup problems in flexible manufacturing systems
A branch and bound procedure for setup problems in flexible manufacturing systems
1993,
The authors address a medium- to short-term production planning problem in a flexible...
A new branch and bound algorithm for loading problems in flexible manufacturing systems
A new branch and bound algorithm for loading problems in flexible manufacturing systems
1994,
Loading problems in flexible manufacturing systems involve assigning operations for...
Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
1991,
It is known that a best-first search algorithm like A* requires too much space...
Effective use of memory in iterative deepening search
Effective use of memory in iterative deepening search
1992,
The Iterative Deepening A* (IDA*) algorithm often reexpands too many nodes...
Solving large-scale tour scheduling problems
Solving large-scale tour scheduling problems
1994,
For a given planning horizon, workforce composition and set of labor requirements,...
A genetic algorithm for the job shop problem
A genetic algorithm for the job shop problem
1995,
In this paper the authors introduce a genetic algorithm whose peculiarities are the...
A stationary cyclical production scheduling problem under a nonadditive output function
A stationary cyclical production scheduling problem under a nonadditive output function
1994,
The purpose of this paper is to formulate and solve a nonlinear mixed zero-one integer...
LP-based method for the multi-sheet cutting stock problem
LP-based method for the multi-sheet cutting stock problem
1994,
The rectangular cutting-stock problem consists in laying out a specified list of...
Algorithms for real-time scheduling of jobs on mixed model assembly lines
Algorithms for real-time scheduling of jobs on mixed model assembly lines
1994,
The problem of how to sequence jobs with options on a mixed model assembly line...
A real-time one-dimensional cutting stock algorithm for balanced cutting patterns
A real-time one-dimensional cutting stock algorithm for balanced cutting patterns
1993,
In the steel industry when a finished structural shape, exits the mill upon which it...
Multi-facility location using a maximin criterion and rectangular distances
Multi-facility location using a maximin criterion and rectangular distances
1994,
A branch and bound algorithm is suggested to solve the maximin multiple facilities...
A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
1994,
The authors present an algorithm that combines branch and bound with cutting planes to...
A branch-and-bound approach to solve a bicriterion scheduling problem involving squared flowtime and maximum tardiness
A branch-and-bound approach to solve a bicriterion scheduling problem involving squared flowtime and maximum tardiness
1994,
This paper considers a bicriterion scheduling problem in which a linear combination of...
A survey of parallel algorithms for one-dimensional integer knapsack problems
A survey of parallel algorithms for one-dimensional integer knapsack problems
1994,
This article surveys several methods that can be used to solve integer knapsack...
An improved branch and bound algorithm for mixed integer nonlinear programs
An improved branch and bound algorithm for mixed integer nonlinear programs
1994,
This paper describes an improved branch and bound code for zero-one mixed integer...
An algorithm for solving convex programs with an additional convex-concave constraint
An algorithm for solving convex programs with an additional convex-concave constraint
1993,
An implementable decomposition method based on branch-and-bound techniques is proposed...
Solving airline crew scheduling problems by branch-and-cut
Solving airline crew scheduling problems by branch-and-cut
1993,
The crew scheduling problem is one that has been studied almost continually for the...
A minimax assignment problem on a linear communication network
A minimax assignment problem on a linear communication network
1993,
A system of n communication centres is considered. The communication centres are to be...
Optimal sequence of partial inspections subject to errors
Optimal sequence of partial inspections subject to errors
1994,
Multiple inspections are necessary in some important areas of production systems. The...
Papers per page: