- Combinatorial Optimization Submissions - 2007 February 2007 Approximation Algorithms Polynomial time algorithms to approximate mixed volumes within a simply exponential factor Leonid Gurvits Inverse Bottleneck Optimization Problems under Weighted Hamming Distance Xiucui Guan, Jianzhong Zhang Polyhedra Simple Explicit Formula for Counting Lattice Points of Polyhedra J.B. Lasserre, E.S. Zeron The operator $\Psi$ for the Chromatic Number of a Graph Nebojsa Gvozdenovic, Monique Laurent Computing the $\psi$ and $\Psi$ semidefinite programming bounds for the chromatic number Nebojsa Gvozdenovic, Monique Laurent April 2007 Hyperplane Arrangements with Large Average Diameter Antoine Deza, Feng Xie A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem Artur Pessoa, Marcus Poggi de Aragão, Eduardo Uchoa Graphs and Matroids Gap, cosum, and product properties of the Lov\'asz-Schrijver bound on the clique number Immanuel Bomze, Florian Frommlet, Marco Locatelli June 2007 Polyhedra On the strength of cut-based inequalities for capacitated network design polyhedra Christian Raack, Arie M.C.A. Koster, Roland Wessäly Other Expressing Combinatorial Optimization Problems by Systems of Polynomial Equations and the Nullstellensatz Jesus De Loera, Jon Lee, Susan Margulies, Shmuel Onn Minimum weight t-composition of an integer Domingos M. Cardoso, J. Orestes Cerdeira Tractable algorithms for chance-constrained combinatorial problems Olivier Klopfenstein Graphs and Matroids New Lower Bounds on the Stability Number of a Graph E. Alper YILDIRIM July 2007 Graphs and Matroids Facet Defining Inequalities among Graph Invariants: the system GraPHedron Hadrien Mélot Approximation Algorithms Approximate Solutions for Deterministic and Stochastic Multi-Dimensional Sequencing Chandra Poojari, Sachin Patkar, B Jothi, Janak Porwal Graphs and Matroids Nonlinear Matroid Optimization and Experimental Design Yael Berstein, Jon Lee, Hugo Maruri-Aguilar, Shmuel Onn, Eva Riccomagno, Robert Weismantel, Henry Wynn August 2007 Approximation Algorithms Revisiting the Greedy Approach to Submodular Set Function Maximization Pranava R. Goundan, Andreas S. Schulz November 2007 Polyhedra On the integrality of the uncapacitated facility location polytope Mourad Baiou, Francisco Barahona A simple exact separation algorithm for 2-matching inequalities. Julian Araoz, Elena Fernandez, Oscar Meza Exact Algorithms for the Quadratic Linear Ordering Problem Christoph Buchheim, Angelika Wiegele, Lanbo Zheng Visitors Authors More about us Links Subscribe, Unsubscribe Digest Archive Search, Browse the Repository Submit Update Policies Coordinator's Board Classification Scheme Credits Give us feedback Optimization Journals, Sites, Societies Optimization Online is supported by the Mathematical Programming Society and by the Optimization Technology Center.