Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Pedersen, Christian Roed"'
Publikováno v:
In Computers and Operations Research 2008 35(11):3714-3726
Autor:
Pedersen, Christian Roed1 crpe@tdc.dk, Nielsen, Lars Relund2 lars@relund.dk, Andersen, Kim Allan3 kia@asb.dk
Publikováno v:
INFORMS Journal on Computing. Summer2008, Vol. 20 Issue 3, p400-411. 12p. 5 Diagrams, 2 Charts, 5 Graphs.
Autor:
Pedersen, Christian Roed
Publikováno v:
Pedersen, C R 2006, Multicriteria Discrete Optimization-and Related Topics .
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::81ddd947179aadc53bded852c49ee41c
https://pure.au.dk/portal/da/publications/multicriteria-discrete-optimization--and-related-topics(372acf90-bc36-11db-bee9-02004c4f4f50).html
https://pure.au.dk/portal/da/publications/multicriteria-discrete-optimization--and-related-topics(372acf90-bc36-11db-bee9-02004c4f4f50).html
Publikováno v:
Pedersen, C R, Nielsen, L R & Andersen, K A 2005 ' On the Bicriterion Multi Modal Assignment Problem ' .
We consider the bicriterion multi modal assignment problem which is a new generalization of the classical linear assignment problem. A two-phase solution method using an effective ranking scheme is presented. The algorithm is valid for generating all
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pure_au_____::9a805f2776bbf9460674f24968a674b4
https://pure.au.dk/portal/da/publications/on-the-bicriterion-multi-modal-assignment-problem(f90f5cc0-93dd-11da-bee9-02004c4f4f50).html
https://pure.au.dk/portal/da/publications/on-the-bicriterion-multi-modal-assignment-problem(f90f5cc0-93dd-11da-bee9-02004c4f4f50).html
Given a discrete bicriteria optimization problem (DBOP), we propose two versions of an approximation procedure, the box algorithm, which results in a representation of the complete set of nondominated solutions by a finite representative system Rep s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::7f7e386544b1a4fb326285a2aa4f3262
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1655
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1655
Publikováno v:
Pedersen, C R, Nielsen, L R & Andersen, K A 2005 ' A note on ranking assignments using reoptimization ' .
We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggested by Murty, is presented where, for each partition, the optimal assignm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pure_au_____::2c095bd62cf89666275935c97e29a032
https://pure.au.dk/portal/da/publications/a-note-on-ranking-assignments-using-reoptimization(41ffc710-93e0-11da-bee9-02004c4f4f50).html
https://pure.au.dk/portal/da/publications/a-note-on-ranking-assignments-using-reoptimization(41ffc710-93e0-11da-bee9-02004c4f4f50).html
Publikováno v:
Hamacher, H W, Pedersen, C R & Ruzika, S 2005 ' Multiple Objective Minimum Cost Flow Problems: A Review ' .
In this paper, theory and algorithms for solving the multiple objective minimum cost flow problem are reviewed. For both the continuous and integer case exact and approximation algorithms are presented. In addition, a section on compromise solutions
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pure_au_____::725059e780dd0aad2e281a7239dda0f4
https://pure.au.dk/portal/da/publications/multiple-objective-minimum-cost-flow-problems-a-review(fb760610-93e9-11da-bee9-02004c4f4f50).html
https://pure.au.dk/portal/da/publications/multiple-objective-minimum-cost-flow-problems-a-review(fb760610-93e9-11da-bee9-02004c4f4f50).html
Publikováno v:
In Operations Research Letters 2007 35(3):336-344
Autor:
Hamacher, Horst W.1 hamacher@mathematik.uni-kl.de, Pedersen, Christian Roed2 roed@imf.au.dk, Ruzika, Stefan1 ruzika@mathematik.uni-kl.de
Publikováno v:
European Journal of Operational Research. Feb2007, Vol. 176 Issue 3, p1404-1422. 19p.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.