volume 32, issue 4, P549-566 2004
DOI: 10.1007/s00454-004-1138-y
View full text
|
|
Share

Abstract: Abstract. We introduce the convex combinatorial optimization problem, a far-reaching generalization of the standard linear combinatorial optimization problem. We show that it is strongly polynomial time solvable over any edge-guaranteed family, and discuss several applications.

Search citation statements

Order By: Relevance

Paper Sections

0
0
0
0
0

Citation Types

3
32
0

Publication Types

Select...

Relationship

0
0

Authors

Journals