Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 145
Volume 145, Numbers 1-2, June 2014
- Raymond Hemmecke, Matthias Köppe
, Robert Weismantel:
Graver basis and proximity techniques for block-structured separable convex integer minimization problems. 1-18 - Amitabh Basu, Robert Hildebrand, Matthias Köppe:
The triangle closure is a polyhedron. 19-58 - Francisco Facchinei, Jong-Shi Pang, Gesualdo Scutari, Lorenzo Lampariello:
VI-constrained hemivariational inequalities: distributed algorithms and power control in ad-hoc networks. 59-96 - Zhou Wei, Jen-Chih Yao, Xi Yin Zheng:
Strong Abadie CQ, ACQ, calmness and linear regularity. 97-131 - Antonio Frangioni, Enrico Gorgone:
Bundle methods for sum-functions with "easy" components: applications to multicommodity network design. 133-161 - Kazuo Murota, Akiyoshi Shioura:
Dijkstra's algorithm and L-concave function maximization. 163-177 - William W. Hager, James T. Hungerford:
Optimality conditions for maximizing a function over a polyhedron. 179-198 - Santanu S. Dey, Sebastian Pokutta:
Design and verify: a new scheme for generating cutting-planes. 199-222 - Philipp W. Keller, Retsef Levi, Georgia Perakis:
Efficient formulations for pricing under attraction demand models. 223-261 - Fabián Flores Bazán, Gabriel Cárcamo:
A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints. 263-290 - Monique Laurent, Antonios Varvitsiotis:
A new graph parameter related to bounded rank positive semidefinite matrix completions. 291-325 - Daniel Dadush, Santanu S. Dey, Juan Pablo Vielma:
On the Chvátal-Gomory closure of a compact convex set. 327-348 - Kelly M. Sullivan, J. Cole Smith, David P. Morton:
Convex hull representation of the deterministic bipartite network interdiction problem. 349-376 - Sungjin Im, Maxim Sviridenko, Ruben van der Zwaan:
Preemptive and non-preemptive generalized min sum set cover. 377-401 - Kwanghun Chung, Jean-Philippe P. Richard, Mohit Tawarmalani:
Lifted inequalities for $$0\mathord {-}1$$ mixed-integer bilinear covering sets. 403-450 - Yoel Drori, Marc Teboulle:
Performance of first-order methods for smooth convex minimization: a novel approach. 451-482 - Sanjeeb Dash, Neil B. Dobbs, Oktay Günlük, Tomasz Nowicki, Grzegorz Swirszcz:
Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming. 483-508 - Herbert Hamers, Silvia Miquel, Henk Norde:
Monotonic stable solutions for minimum coloring games. 509-529 - M. Kanat Camlibel, Luigi Iannelli, Francesco Vasca:
Passivity and complementarity. 531-563 - Gustavo Angulo, Shabbir Ahmed, Santanu S. Dey:
Semi-continuous network flow problems. 565-599 - Andrzej Ruszczynski:
Erratum to: Risk-averse dynamic programming for Markov decision processes. 601-604
a service of 
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-04-26 17:31 CEST 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:
