Convex Combinatorial Optimization

Details Convex Combinatorial Optimization Convex Combinatorial Optimization

2003-09-05

arxiv.org/abs/math/0309083v1

Discrete and Computational Geometry, 32:549--566, 2004

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Convex Combinatorial Optimization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Convex Combinatorial Optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Convex Combinatorial Optimization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-357983