default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 150
Volume 150, Number 1, April 2015
- Ali Ridha Mahjoub, Giovanni Rinaldi
, Gerhard J. Woeginger:
Preface. 1-3 - Alberto Caprara, Mauro Dell'Amico, José Carlos Díaz Díaz, Manuel Iori, Romeo Rizzi:
Friendly bin packing instances without Integer Round-up Property. 5-17 - Basile Couëtoux, James M. Davis, David P. Williamson:
A 3/2-approximation algorithm for some minimum-cost graph problems. 19-34 - Satoru Fujishige, Jens Maßberg:
Dual consistent systems of linear inequalities and cardinality constrained polytopes. 35-48 - Luis Eduardo Neves Gouveia, Markus Leitner, Ivana Ljubic:
The two-level diameter constrained spanning tree problem. 49-78 - Qie He, Shabbir Ahmed, George L. Nemhauser:
Minimum concave cost flow over a grid network. 79-98 - James Ostrowski, Miguel F. Anjos, Anthony Vannelli:
Modified orbital branching for structured symmetry with an application to unit commitment. 99-129 - Jiawei Qian, Frans Schalekamp, David P. Williamson, Anke van Zuylen:
On the integrality gap of the subtour LP for the 1, 2-TSP. 131-151 - László A. Végh, Bernhard von Stengel:
Oriented Euler complexes and signed perfect matchings. 153-178
Volume 150, Number 2, May 2015
- Wen Huang, Pierre-Antoine Absil, Kyle A. Gallivan:
A Riemannian symmetric rank-one trust-region method. 179-216 - Felipe Cucker, Javier Peña, Vera Roshchina:
Solving second-order conic systems with variable precision. 217-250 - Radu Ioan Bot, Ernö Robert Csetnek, André Heinrich, Christopher Hendrich:
On the convergence rate improvement of a primal-dual splitting algorithm for solving monotone inclusion problems. 251-279 - Dimitris Bertsimas, Vineet Goyal, Brian Y. Lu:
A tight characterization of the performance of static solutions in two-stage adjustable robust linear optimization. 281-319 - Mengdi Wang, Dimitri P. Bertsekas:
Incremental constraint projection methods for variational inequalities. 321-363 - Emil Gustavsson, Michael Patriksson, Ann-Brith Strömberg:
Primal convergence from dual subgradient methods for convex optimization. 365-390 - Anders Skajaa, Yinyu Ye:
A homogeneous interior-point algorithm for nonsymmetric convex conic optimization. 391-422 - Bo Jiang, Shiqian Ma, Shuzhong Zhang:
Tensor principal component analysis via convex optimization. 423-457 - Yogesh Awate, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel:
On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs. 459-489 - Natashia L. Boland, Andrew C. Eberhard:
On the augmented Lagrangian dual for integer programming. 491-509 - Marco Locatelli:
Improving upper bounds for the clique number by non-valid inequalities. 511-525
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-19 20:48 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:
