Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Keyword: Lagrangean relaxation
Found
11 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Lagrangean/surrogate relaxation for generalized assignment problems
1999,
Lorena Luiz Antonio N.
This work presents Lagrangean/surrogate relaxation to the problem of maximum profit...
Efficient cuts in Lagrangean ‘relax-and-cut’ schemes
1998,
Guignard Monique
Lagrangean relaxation produces bounds on the optimal value of (mixed) integer...
A tree search algorithm for the crew scheduling problem
1996,
Beasley J.E.
In this paper we consider the crew scheduling problem, that is the problem of...
Lagrangean relaxation: A short course
1995,
Giugnard M.
This paper presents the necessary background for understanding and designing efficient...
Average shadow price in a Mixed Integer Linear Programming problem
1995,
Crema Alejandro
Recently a new concept of shadow price, the average shadow price, based on the average...
Solution of a tinned iron purchasing problem by Lagrangean relaxation
1995,
Dorhout B.
A tin factory obtains its material from steel works. This consists of sheets of tinned...
A new Lagrangian relaxation based algorithm for a class of multidimensional assignment problems
1997,
Poore Aubrey B.
Large classes of data association problems in multiple target tracking applications...
New formulation and relaxation to solve a concave-cost network flow problem
1997,
Pirkul Hasan
This paper studies a minimum cost, multicommodity network flow problem in which the...
New lower and upper bounds for scheduling around a small common due date
1994,
Velde S.L. van de
The authors consider the single-machine problem of scheduling n jobs to minimize the...
The use of Lagrangean Relaxation in the solution of uncapacitated facility location problems
1993,
Galvo R.D.
This paper reviews the use of Lagrangean Relaxation in the solution of uncapacitated...
The multiple Bottleneck Transportation Problem
1993,
Karwan Mark H.
An extension to the Bottleneck Transportation Problem (BTP) is considered wherein a...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers