default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 141
Volume 141, Numbers 1-2, October 2013
- Steffen Borgwardt:
On the diameter of partition polytopes and vertex-disjoint cycle cover. 1-20 - Angel Corberán, Isaac Plana
, Antonio M. Rodríguez-Chía, José M. Sanchis:
A branch-and-cut algorithm for the maximum benefit Chinese postman problem. 21-48 - Stephen M. Robinson:
Equations on monotone graphs. 49-101 - Shashi Mittal, Andreas S. Schulz:
An FPTAS for optimizing a class of low-rank functions over a polytope. 103-120 - Arnaud Pêcher, Annegret Katrin Wagler:
Computing clique and chromatic number of circular-perfect graphs in polynomial time. 121-133 - Adrian S. Lewis, Michael L. Overton:
Nonsmooth optimization via quasi-Newton methods. 135-163 - Monia Giandomenico, Fabrizio Rossi, Stefano Smriglio:
Strong lift-and-project cutting planes for the stable set problem. 165-192 - Tobias Harks, Martin Hoefer, Max Klimm, Alexander Skopalik:
Computing pure Nash and strong equilibria in bottleneck congestion games. 193-215 - Ming Zhao, Ismael Regis de Farias Jr.:
The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints. 217-255 - Friedrich Eisenbrand, Nicolai Hähnle, Dömötör Pálvölgyi, Gennady Shmonin:
Testing additive integrality gaps. 257-271 - Xin Chen, Jiming Peng, Shuzhong Zhang:
Sparse solutions to random standard quadratic optimization problems. 273-293 - Wei Hong Yang, Xiaoming Yuan:
The GUS-property of second-order cone linear complementarity problems. 295-317 - Jonathan Eckstein, Paulo J. S. Silva:
A practical relative error criterion for augmented Lagrangians. 319-348 - Donald Goldfarb, Shiqian Ma, Katya Scheinberg:
Fast alternating linearization methods for minimizing the sum of two convex functions. 349-382 - Benedict Geihe, Martin Lenz, Martin Rumpf, Rüdiger Schultz:
Risk averse elastic shape optimization with parametrized fine scale geometry. 383-403 - Dominik Skanda, Dirk Lebiedz:
A robust optimization approach to experimental design for model discrimination of dynamical systems. 405-433 - Christoph Buchheim, Angelika Wiegele:
Semidefinite relaxations for non-convex quadratic mixed-integer programming. 435-452 - André Renato Sales Amaral, Adam N. Letchford:
A polyhedral approach to the single row facility layout problem. 453-477 - Nikhil Bansal, Rohit Khandekar, Jochen Könemann, Viswanath Nagarajan, Britta Peis:
On generalizations of network design problems with degree bounds. 479-506 - Santanu S. Dey, Diego A. Morán R.:
Some properties of convex hulls of integer points contained in general convex sets. 507-526 - Ankit Aggarwal, Anand Louis, Manisha Bansal, Naveen Garg, Neelima Gupta, Shubham Gupta, Surabhi Jain:
A 3-approximation algorithm for the facility location problem with uniform capacities. 527-547 - Thành Nguyen:
A simple LP relaxation for the asymmetric traveling salesman problem. 549-559 - Amitabh Basu, Manoel B. Campêlo, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Unique lifting of integer variables in minimal inequalities. 561-576 - Emmanuel J. Candès, Benjamin Recht:
Simple bounds for recovering low-complexity models. 577-589 - Sanjeeb Dash, Oktay Günlük:
On t-branch split cuts for mixed-integer programs. 591-599 - Maarten H. van der Vlerk:
Erratum to: Convex approximations for complete integer recourse models. 601-602
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 2025-12-12 01:09 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:
