Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Keyword: programming: branch and bound
Found
862 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Reformulation of capacitated facility location problems: How redundant information can help
1998,
Aardal Karen
When solving hard combinatorial optimization problems by branch-and-bound, obtaining a...
Optimal clustering of frequency-constrained maintenance jobs with shared set-ups
1997,
Dijkhuizen Gerhard van
Since maintenance jobs often require one or more set-up activities, joint execution or...
Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time
1998,
Hariri A.M.A.
This paper presents several branch and bound algorithms for a single-machine...
Parallel branch-and-bound methods for the job-shop scheduling problem
1998,
Clausen Jens
Job-Shop Scheduling (JSS) problems are among the more difficult to solve in the class...
A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
1997,
Kise Hiroshi
This paper considers an m -machine permutation flowshop scheduling problem of...
Optimal strategy of route and look for the path constrained search problem with reward criterion
1997,
Iida Koji
A target is moving among a finite number of cells K ={1,..., K } in discrete...
A branch and bound algorithm for scheduling projects to maximise net present value: the case of time dependent, contingent cash flows
1997,
Shtub A.
The problem of scheduling activities in a project to maximize its net present value...
One machine scheduling to minimize the maximum earliness with minimum number of tardy jobs
1998,
Erol Serpil
In this study we consider the problem of sequencing n jobs on one machine under the...
A new branching scheme for job shop scheduling
1998,
Loureno Helena Ramalhinho
The job-shop scheduling problem consists in scheduling a set of jobs on a set of...
Staged and constrained two-dimensional guillotine cutting problems: An AND/OR-graph approach
1996,
Morabito Reinaldo
An AND/OR-graph approach has been proposed by Morabito et al . to solve non-staged and...
Application of traveling salesman problem for decision of optimal production sequence
1997,
Chang K.S.
In the present study a reliable and structural decision system for production sequence...
Assembly system design: A branch and cut approach
1998,
Wilhelm Wilbert E.
This paper addresses the single-product assembly system design problem (ASDP), which...
A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs
1996,
Valls Vicente
Acyclic directed graphs are widely used in many fields of economic and social...
Solving to optimality the uncapacitated fixed-charge network flow problem
1998,
Mateus G.R.
We present the uncapacitated fixed-charge network flow problem and two mathematical...
Linear programming for the 0–1 quadratic knapsack problem
1996,
Billionnet Alain
In this paper we consider the quadratic knapsack problem which consists in maximizing...
Parallel search algorithms for discrete optimization problems
1995,
Grama Ananth
Discrete optimization problems (DOPs) arise in various applications such as planning,...
A branch and bound algorithm for integer quadratic knapsack problems
1995,
Shetty Bala
We present a branch and bound algorithm for solving separable convex quadratic...
A branch-and-bound approach using polyhedral resuls for a clustering problem
1997,
Palubeckis Gintaras
This article describes a variation of the branch and bound method for solving a...
Maximizing the production rate in simple assembly line balancing – a branch and bound procedure
1996,
Scholl Armin
In this paper, a branch and bound procedure for the Simple Assembly Line Balancing...
An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations
1998,
Herroelen Willy S.
In this paper, we consider the resource-constrained project scheduling problem (RCPSP)...
The two-machine total completion time flow shop problem
1996,
Tadei R.
In this paper we study the NP-hard scheduling problem of minimizing total completion...
Two branch and bound algorithms for the permutation flow shop problem
1996,
Carlier Jacques
The objective of this paper is to present two exact methods for the permutation flow...
New benchmark results for the resource-constrained project scheduling problem
1997,
Herroelen Willy S.
This paper reports on new insights derived from computational results obtained with an...
Generalized bilinear programming: An application in farm management
1996,
Bloemhof-Ruwaard Jacqueline M.
In this paper we analyze a model which arises from considering manure and fertilizer...
First Page
28
29
30
31
32
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers