Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 121
Volume 121, Number 1, January 2010
- Anureet Saxena, Vineet Goyal, Miguel A. Lejeune
:
MIP reformulations of the probabilistic set covering problem. 1-31 - Sanjeeb Dash, Oktay Günlük, Andrea Lodi:
MIR closures of polyhedral sets. 33-60 - Jean-Philippe P. Richard, Mohit Tawarmalani:
Lifting inequalities: a framework for generating strong cuts for nonlinear programs. 61-104 - Satoru Iwata, Mizuyo Takamatsu:
Index minimization of differential-algebraic equations in hybrid analysis for circuit simulation. 105-121 - Yves Pochet, Laurence A. Wolsey:
Single item lot-sizing with non-decreasing capacities. 123-143 - Santanu S. Dey, Jean-Philippe P. Richard, Yanjun Li, Lisa A. Miller:
On the extreme inequalities of infinite group problems. 145-170 - Lanshan Han, Jong-Shi Pang:
Non-Zenoness of a class of differential quasi-variational inequalities. 171-199
Volume 121, Number 2, February 2010
- Peter Gritzmann, Michael Ritter, Paul Zuber:
Optimal wire ordering and spacing in low power semiconductor design. 201-220 - Sebastian Schlenkrich, Andreas Griewank, Andrea Walther:
On the local convergence of adjoint Broyden methods. 221-247 - Igor Dukanovic, Franz Rendl:
Copositive programming motivated bounds on the stability and the chromatic numbers. 249-268 - Irina Dumitrescu, Stefan Ropke, Jean-François Cordeau, Gilbert Laporte:
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm. 269-305 - Franz Rendl, Giovanni Rinaldi, Angelika Wiegele:
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations. 307-335 - Karen I. Aardal, Laurence A. Wolsey:
Lattice based extended formulations for integer linear equality systems. 337-352 - Gongyun Zhao:
Representing the space of linear programs as the Grassmann manifold. 353-386 - Nezam Mahdavi-Amiri, Rohollah Yousefpour:
Constructing a sequence of discrete Hessian matrices of an SC1 function uniformly convergent to the generalized Hessian matrix. 387-414
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-19 19:20 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:
