en
de
Local
OpenID
:
no help available
no help available
BibSonomy
author
tag
user
group
author
concept
BibTeX key
search:all
::
Pferschy
::
The blue social bookmark and publication sharing system.
sign in
home
groups
popular
posts
tags
authors
concepts
discussions
actions for all displayed bookmarks:
export:
RSS
,
BibTeX
,
XML
sort:
criterion:
date
,
title
order:
ascending
,
descending
others:
bookmarks per page:
5
10
20
50
100
bookmarks
actions for all displayed publications:
export:
RSS
,
BibTeX
,
RDF
,
more...
sort:
criterion:
date
,
title
order:
ascending
,
descending
advanced...
others:
publications per page:
5
10
20
50
100
publications
(52)
tags
dblp
knapsack
problems
book
Kombinatorik
Graphentheorie
Numerische_Mathematik
article
constrained
cardinality
Wahrscheinlichkeitsrechnung
Methoden_und_Techniken_der_Betriebswirtschaft
No matching items.
Securitization of Financial Assets: Approximation in Theory and Practice.
Renata Mansini
, and
Ulrich Pferschy
.
Comp. Opt. and Appl.
29(2):147-171
(
2004
)
Renata Mansini
, and
Ulrich Pferschy
.
Comp. Opt. and Appl.
29(2):147-171
(
2004
)
9 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Committee selection under weight constraints.
Christian Klamler
,
Ulrich Pferschy
, and
Stefan Ruzika
.
Mathematical Social Sciences
64(1):48-56
(
2012
)
Christian Klamler
,
Ulrich Pferschy
, and
Stefan Ruzika
.
Mathematical Social Sciences
64(1):48-56
(
2012
)
a year ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
The traveling group problem.
Christian Klamler
, and
Ulrich Pferschy
.
Social Choice and Welfare
29(3):429-452
(
2007
)
Christian Klamler
, and
Ulrich Pferschy
.
Social Choice and Welfare
29(3):429-452
(
2007
)
a year and a month ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
On the Robust Knapsack Problem.
Michele Monaci
, and
Ulrich Pferschy
.
CTW,
page 207-210.
(
2011
)
Michele Monaci
, and
Ulrich Pferschy
.
CTW,
page 207-210.
(
2011
)
a year and 8 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
The Maximum Flow Problem with Conflict and Forcing Conditions.
Ulrich Pferschy
, and
Joachim Schauer
.
INOC,
volume 6701 of Lecture Notes in Computer Science,
page 289-294.
Springer,
(
2011
)
Ulrich Pferschy
, and
Joachim Schauer
.
INOC,
volume 6701 of Lecture Notes in Computer Science,
page 289-294.
Springer,
(
2011
)
a year and 9 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Paths, trees and matchings under disjunctive constraints.
Andreas Darmann
,
Ulrich Pferschy
,
Joachim Schauer
, and
Gerhard J. Woeginger
.
Discrete Applied Mathematics
159(16):1726-1735
(
2011
)
Andreas Darmann
,
Ulrich Pferschy
,
Joachim Schauer
, and
Gerhard J. Woeginger
.
Discrete Applied Mathematics
159(16):1726-1735
(
2011
)
a year and 10 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Competitive subset selection with two agents.
Gaia Nicosia
,
Andrea Pacifici
, and
Ulrich Pferschy
.
Discrete Applied Mathematics
159(16):1865-1877
(
2011
)
Gaia Nicosia
,
Andrea Pacifici
, and
Ulrich Pferschy
.
Discrete Applied Mathematics
159(16):1865-1877
(
2011
)
a year and 10 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Approximation Algorithms for Knapsack Problems with Cardinality Constraints
Alberto Caprara
,
Hans Kellerer
,
Ulrich Pferschy
, and
David Pisinger
.
European Journal of Operational Research
(
1998
)
Alberto Caprara
,
Hans Kellerer
,
Ulrich Pferschy
, and
David Pisinger
.
European Journal of Operational Research
(
1998
)
a year and 10 months ago
by
pcbouman
1
article
cardinality
constrained
knapsack
article
cardinality
constrained
knapsack
URL
DOI
TeX
Knapsack Problems
H. Kellerer
,
U. Pferschy
, and
D. Pisinger
.
Springer, Berlin, Germany,
(
2004
)
H. Kellerer
,
U. Pferschy
, and
D. Pisinger
.
Springer, Berlin, Germany,
(
2004
)
a year and 10 months ago
by
pcbouman
2
book
knapsack
problems
book
knapsack
problems
URL
DOI
TeX
Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem.
Gunnar W. Klau
,
Ivana Ljubic
,
Andreas Moser
,
Petra Mutzel
,
Philipp Neuner
,
Ulrich Pferschy
,
Günther R. Raidl
, and
René Weiskircher
.
GECCO 1,
volume 3102 of Lecture Notes in Computer Science,
page 1304-1315.
Springer,
(
2004
)
Gunnar W. Klau
,
Ivana Ljubic
,
Andreas Moser
,
Petra Mutzel
,
Philipp Neuner
,
Ulrich Pferschy
,
Günther R. Raidl
, and
René Weiskircher
.
GECCO 1,
volume 3102 of Lecture Notes in Computer Science,
page 1304-1315.
Springer,
(
2004
)
a year and 11 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
The Fractional Prize-Collecting Steiner Tree Problem on Trees: Extended Abstract.
Gunnar W. Klau
,
Ivana Ljubic
,
Petra Mutzel
,
Ulrich Pferschy
, and
René Weiskircher
.
ESA,
volume 2832 of Lecture Notes in Computer Science,
page 691-702.
Springer,
(
2003
)
Gunnar W. Klau
,
Ivana Ljubic
,
Petra Mutzel
,
Ulrich Pferschy
, and
René Weiskircher
.
ESA,
volume 2832 of Lecture Notes in Computer Science,
page 691-702.
Springer,
(
2003
)
a year and 11 months ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Greedy Algorithms for On-Line Data Compression.
József Békési
,
Gábor Galambos
,
Ulrich Pferschy
, and
Gerhard J. Woeginger
.
J. Algorithms
25(2):274-289
(
1997
)
József Békési
,
Gábor Galambos
,
Ulrich Pferschy
, and
Gerhard J. Woeginger
.
J. Algorithms
25(2):274-289
(
1997
)
2 years ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Approximation Schemes for Ordered Vector Packing Problems.
Alberto Caprara
,
Hans Kellerer
, and
Ulrich Pferschy
.
RANDOM-APPROX,
volume 2129 of Lecture Notes in Computer Science,
page 63-74.
Springer,
(
2001
)
Alberto Caprara
,
Hans Kellerer
, and
Ulrich Pferschy
.
RANDOM-APPROX,
volume 2129 of Lecture Notes in Computer Science,
page 63-74.
Springer,
(
2001
)
2 years ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Approximating Multi-objective Knapsack Problems.
Thomas Erlebach
,
Hans Kellerer
, and
Ulrich Pferschy
.
WADS,
volume 2125 of Lecture Notes in Computer Science,
page 210-221.
Springer,
(
2001
)
Thomas Erlebach
,
Hans Kellerer
, and
Ulrich Pferschy
.
WADS,
volume 2125 of Lecture Notes in Computer Science,
page 210-221.
Springer,
(
2001
)
2 years ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
A New Fully Polynomial Approximation Scheme for the Knapsack Problem.
Hans Kellerer
, and
Ulrich Pferschy
.
APPROX,
volume 1444 of Lecture Notes in Computer Science,
page 123-134.
Springer,
(
1998
)
Hans Kellerer
, and
Ulrich Pferschy
.
APPROX,
volume 1444 of Lecture Notes in Computer Science,
page 123-134.
Springer,
(
1998
)
2 years ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
A 3/4-Approximation Algorithm for Multiple Subset Sum.
Alberto Caprara
,
Hans Kellerer
, and
Ulrich Pferschy
.
J. Heuristics
9(2):99-111
(
2003
)
Alberto Caprara
,
Hans Kellerer
, and
Ulrich Pferschy
.
J. Heuristics
9(2):99-111
(
2003
)
2 years and a month ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
The Fractional Greedy Algorithm for Data Compression.
József Békési
,
Gábor Galambos
,
Ulrich Pferschy
, and
Gerhard J. Woeginger
.
Computing
56(1):29-46
(
1996
)
József Békési
,
Gábor Galambos
,
Ulrich Pferschy
, and
Gerhard J. Woeginger
.
Computing
56(1):29-46
(
1996
)
2 years and a month ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Solution Methods and Computational Investigations for the Linear Bottleneck Assignment Problem.
Ulrich Pferschy
.
Computing
59(3):237-258
(
1997
)
Ulrich Pferschy
.
Computing
59(3):237-258
(
1997
)
2 years and a month ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem.
Hans Kellerer
, and
Ulrich Pferschy
.
J. Comb. Optim.
3(1):59-71
(
1999
)
Hans Kellerer
, and
Ulrich Pferschy
.
J. Comb. Optim.
3(1):59-71
(
1999
)
2 years and a month ago
by
dblp
1
dblp
dblp
URL
DOI
TeX
Knapsack problems.
Hans Kellerer
,
Ulrich Pferschy
, and
David Pisinger
.
Springer,
(
2004
)
Hans Kellerer
,
Ulrich Pferschy
, and
David Pisinger
.
Springer,
(
2004
)
2 years and 2 months ago
by
dblp
2
dblp
dblp
URL
DOI
TeX
BibSonomy is offered by the
KDE group
of the University of Kassel, the
DMIR group
of the University of Würzburg, and the
L3S Research Center
, Germany.
Privacy & Terms of Use
-
Contact