Keyword: programming: branch and bound

Found 862 papers in total
Target assignment problem for air raid
Target assignment problem for air raid
1999,
Two formulations of the target assignment problem are considered. The first one...
Optimization models for mine planning
Optimization models for mine planning
1999,
Mixed Integer Linear Programming models are presented to develop a schedule for the...
Constrained two-dimensional cutting stock problems: A best-first branch-and-bound algorithm
Constrained two-dimensional cutting stock problems: A best-first branch-and-bound algorithm
2000,
In this paper, we develop a new version of an algorithm for solving exactly some...
Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem
Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem
1999,
This article introduces two new techniques for solving the Quadratic Assignment...
Progress in linear programming-based algorithms for integer programming: An exposition
Progress in linear programming-based algorithms for integer programming: An exposition
2000,
This paper is about modeling and solving mixed integer programming problems. In the...
Propagation of interval values in simple processing networks
Propagation of interval values in simple processing networks
1999,
Process network optimization problems are prevalent in the processing industries....
Benders-and-cut algorithm for fixed-charge capacitated network design problem
Benders-and-cut algorithm for fixed-charge capacitated network design problem
2000,
We develop a Benders-and-cut algorithm for fixed-charge capacitated network design...
Reliability optimization of a series system with multiple-choice and budget constraints
Reliability optimization of a series system with multiple-choice and budget constraints
2000,
This paper considers a reliability optimization problem for a series system with...
Integer programming model and exact solution for concentrator location problem
Integer programming model and exact solution for concentrator location problem
2000,
Topological design of centralized computer networks is an important problem that has...
Resource sharing and scheduling for cyclic production in a computer-integrated manufacturing cell
Resource sharing and scheduling for cyclic production in a computer-integrated manufacturing cell
1999,
This paper deals with the decision making for resource sharing and scheduling for a...
Minimising maximum lateness in a two-machine flowshop
Minimising maximum lateness in a two-machine flowshop
2000,
The objective of this paper is to develop a branch and bound algorithm for the problem...
Optimal planning in large multi-site production networks
Optimal planning in large multi-site production networks
2000,
This contribution describes a general mixed-integer linear programming model based on...
bc – prod: A specialized branch-and-cut system for lot-sizing problems
bc – prod: A specialized branch-and-cut system for lot-sizing problems
2000,
bc – prod is a prototype modelling and optimization system designed and able to...
On not-first/not-last conditions in disjunctive scheduling
On not-first/not-last conditions in disjunctive scheduling
2000,
This paper is concerned with the development of constraint propagation techniques for...
Using intelligent backtracking to improve branch-and-bound methods: An application to open-shop problems
Using intelligent backtracking to improve branch-and-bound methods: An application to open-shop problems
2000,
Only two branch-and-bound methods have been published so far for the Open-Shop...
A cutting plane algorithm for a single machine scheduling problem
A cutting plane algorithm for a single machine scheduling problem
2000,
Each of N part types (production families or items) is to be processed on a single...
Scheduling resource-constrained projects competitively at modest memory requirements
Scheduling resource-constrained projects competitively at modest memory requirements
2000,
We consider the resource-constrained project scheduling problem. The purpose of this...
A cutting plane approach for the single-product assembly system design problem
A cutting plane approach for the single-product assembly system design problem
2000,
This paper evaluates a new branch-and-cut approach, establishing a computational...
A note on ‘An efficient algorithm for the single-machine tardiness problem.’
A note on ‘An efficient algorithm for the single-machine tardiness problem.’
2000,
The focus of this work is to give some comments on a paper recently published by...
Scheduling a batch processing machine with non-identical job sizes
Scheduling a batch processing machine with non-identical job sizes
2000,
The problem of scheduling batch processors is important in some industries and, at a...
An enhancement of an analytical approach: The case of the weighted maximin network location problem
An enhancement of an analytical approach: The case of the weighted maximin network location problem
2000,
A well known analytical approach which determines an optimal solution for the weighted...
An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
2000,
We propose an interactive reference point approach for multiple objective (mixed)...
2-path cuts for the vehicle routing problem with time windows
2-path cuts for the vehicle routing problem with time windows
1999,
This paper introduces a strong valid inequality, the 2-path cut, to produce better...
Branch-and-price algorithms for the one-dimensional cutting stock problem
Branch-and-price algorithms for the one-dimensional cutting stock problem
1998,
We compare two branch-and-price approaches for the cutting stock problem. Each...
Papers per page: