Add to ORKG"(Revised January 25, 1998)"--T.p. -- "February 1998."--Cover.Includes bibliographical references (p. 23-25).Supported by a grant from the United Parcel Service and a contract from the Office of Naval Research. ONR N00014-96-1-0051Ravindra K. Ahuja, James B. Orlin
The goal of this paper is to provide a basic overview of several different operations research probl...
Part 2: Algorithms and ComplexityInternational audienceGiven a network $G(N,\!A,\!C)$ and a directed...
Caption title.Includes bibliographical references (p. 9-10).Supported by the NSF. CCR-9103804by Dimi...
"(Revised January 25, 1998)"--T.p. -- "February 1998."--Cover.Includes bibliographical references (p...
AbstractIn this paper we consider some inverse LP problems in which we need to adjust the cost coeff...
We study inverse optimization problems, wherein the goal is to map given solutions to an underlying ...
In the context of inverse optimization, inverse versions of maximum flow and minimum cost flow probl...
The problem is to modify the capacities of the arcs from a network so that a given feasible flow bec...
AbstractA general approach is presented for handling the following inverse optimization problem: giv...
Given a feasible solution to a particular combinatorial optimization problem defined on a graph and ...
This paper looks at several methods for solving network flow problems. The first chapter gives a bri...
. We examine the computational complexity of the inverse shortest paths problem with upper bounds on...
Given a (combinatorial) optimization problem and a feasible solution to it, the corresponding invers...
Given a generalized network and a generalized feasible flow fo, se condider a problem finding a modi...
A basis for a pure network flow problem always exhibits special structure, whose exploitation has le...
The goal of this paper is to provide a basic overview of several different operations research probl...
Part 2: Algorithms and ComplexityInternational audienceGiven a network $G(N,\!A,\!C)$ and a directed...
Caption title.Includes bibliographical references (p. 9-10).Supported by the NSF. CCR-9103804by Dimi...
"(Revised January 25, 1998)"--T.p. -- "February 1998."--Cover.Includes bibliographical references (p...
AbstractIn this paper we consider some inverse LP problems in which we need to adjust the cost coeff...
We study inverse optimization problems, wherein the goal is to map given solutions to an underlying ...
In the context of inverse optimization, inverse versions of maximum flow and minimum cost flow probl...
The problem is to modify the capacities of the arcs from a network so that a given feasible flow bec...
AbstractA general approach is presented for handling the following inverse optimization problem: giv...
Given a feasible solution to a particular combinatorial optimization problem defined on a graph and ...
This paper looks at several methods for solving network flow problems. The first chapter gives a bri...
. We examine the computational complexity of the inverse shortest paths problem with upper bounds on...
Given a (combinatorial) optimization problem and a feasible solution to it, the corresponding invers...
Given a generalized network and a generalized feasible flow fo, se condider a problem finding a modi...
A basis for a pure network flow problem always exhibits special structure, whose exploitation has le...
The goal of this paper is to provide a basic overview of several different operations research probl...
Part 2: Algorithms and ComplexityInternational audienceGiven a network $G(N,\!A,\!C)$ and a directed...
Caption title.Includes bibliographical references (p. 9-10).Supported by the NSF. CCR-9103804by Dimi...