default search action
Mathematical Programming, Volume 110
Volume 110, Number 1, June 2007
- Michael Jünger, Volker Kaibel:
Foreword: Special issue on IPCO 2005. 1-2 - Matteo Fischetti, Andrea Lodi:
Optimizing over the first Chvátal closure. 3-20 - Heiko Röglin
, Berthold Vöcking:
Smoothed analysis of integer programming. 21-56 - Gyula Pap:
Combinatorial algorithms for matchings, even factors and square-free 2-factors. 57-69 - Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta:
Approximate min-max relations for odd cycles in planar graphs. 71-91 - Anthony Man-Cho So
On approximating complex quadratic optimization problems via semidefinite programming relaxations. 93-110 - Harold N. Gabow:
On the Linfinity-norm of extreme points for crossing supermodular directed network LPs. 111-144 - Nebojsa Gvozdenovic, Monique Laurent:
Semidefinite bounds for the stability number of a graph via sums of squares of polynomials. 145-173 - Marcus Oswald, Gerhard Reinelt, Dirk Oliver Theis:
On the graphical relaxation of the symmetric traveling salesman polytope. 175-193 - Mohammad Taghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov:
Power optimization for connectivity problems. 195-208 - Alexander Grigoriev
Machine scheduling with resource dependent processing times. 209-228 - Naonori Kakimura, Satoru Iwata:
Computing the inertia from sign patterns. 229-244
Volume 110, Number 2, July 2007
- Yurii E. Nesterov:
Smoothing Technique and its Applications in Semidefinite Optimization. 245-259 - Sven de Vries, Marc E. Posner, Rakesh V. Vohra:
Polyhedral Properties of the K -median Problem on a Tree. 261-285 - Dimitri P. Bertsekas, Paul Tseng:
Set Intersection Theorems and Existence of Optimal Solutions. 287-314 - Masakazu Kojima, Masakazu Muramatsu:
An Extension of Sums of Squares Relaxations to Polynomial Optimization Problems Over Symmetric Cones. 315-336 - Mihai Anitescu
Elastic-mode algorithms for mathematical programs with equilibrium constraints: global convergence and stationarity properties. 337-371 - Andrea Grosso, Marco Locatelli
A Population-based Approach for Hard Global Optimization Problems based on Dissimilarity Measures. 373-404 - Kung Fu Ng, Lu Lin Tan:
Error Bounds of Regularized Gap Functions for Nonsmooth Variational Inequality Problems. 405-429 - Hande Yaman
Restricted Robust Uniform Matroid Maximization Under Interval Uncertainty. 431-441 - Florian A. Potra:
A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with O(ÖnL)-iteration complexity. 443-444
Volume 110, Number 3, September 2007
- Jagat Patel, John W. Chinneck:
Active-constraint variable ordering for faster feasibility of mixed integer linear programs. 445-474 - Chee-Khian Sim
Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem. 475-499 - Sylvia C. Boyd, Sally Cockburn, Danielle Vella:
On the domino-parity inequalities for the STSP. 501-519 - Vaithilingam Jeyakumar
Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions. 521-541 - Yunpeng Pan, Leyuan Shi:
On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems. 543-559 - Todd S. Munson:
Mesh shape-quality optimization using the inverse mean-ratio metric. 561-590 - George Karakostas
Equilibria for networks with malicious users. 591-613 - Adam B. Levy
Constraint incorporation in optimization. 615-639 - Walter Kern, Gerhard J. Woeginger:
Quadratic programming and combinatorial minimum weight product problems. 641-649
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-20 20:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: