The new faces of combinatorial optimization

Authors:
Christos H. Papadimitriou
Affiliations:
University of California at Berkeley
Venue:
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Year:
2012

Citing 7
Cited 0

An introduction to genetic algorithms

An introduction to genetic algorithms
On the approximability of trade-offs and optimal access of Web sources

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
The complexity of pure Nash equilibria

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Succinct approximate convex pareto curves

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On the Hardness of Being Truthful

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems

SIAM Journal on Computing
Approximation of multiobjective optimization problems

Approximation of multiobjective optimization problems

Quantified Score

Hi-index	0.00

Visualization

Abstract

I identify several important current variants on the theme of combinatorial optimization that constitute significant departures from the field's research tradition: Multicriterion optimization, competitive equilibria, and optimizing with incentives. I also discuss the surprisingly weak connections between optimization and evolution (this latter topic was the subject of my ISCO talk).