Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Operations Research, Volume 188
Volume 188, Number 1, August 2011
- Endre Boros
, Yves Crama, Dominique de Werra, Pierre Hansen, Frédéric Maffray:
The mathematics of Peter L. Hammer (1936-2006): graphs, optimization, and Boolean models. 1-18 - Egon Balas:
Projecting systems of linear inequalities with binary variables. 19-31 - Endre Boros, Yves Crama, Peter L. Hammer, Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino:
Logical analysis of data: classification with justification. 33-61 - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Hans Raj Tiwary:
The negative cycles polyhedron and hardness of checking some polyhedral properties. 63-76 - Ondrej Cepek, David Kronus, Petr Kucera:
Analysing DNA microarray data using Boolean techniques. 77-110 - Ferdinando Cicalese, Martin Milanic:
Competitive evaluation of threshold functions in the priced information model. 111-132 - Simone Dantas, Celina M. H. de Figueiredo, Martin Charles Golumbic, Sulamita Klein, Frédéric Maffray:
The chain graph sandwich problem. 133-139 - M. Reza Emamy-Khansary:
A geometric connection to threshold logic via cubical lattices. 141-153 - Bissan Ghaddar, Miguel F. Anjos, Frauke Liers:
A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem. 155-174 - Martin Charles Golumbic, Frédéric Maffray, Grégory Morel:
A characterization of chain probe graphs. 175-183 - Peter Ladislaw Hammer, Alexander Kogan, Miguel A. Lejeune:
Reverse-engineering country risk ratings: a combinatorial non-recursive model. 185-213 - Pierre Hansen, Christophe Meyer:
A new column generation algorithm for Logical Analysis of Data. 215-249 - Oya Ekin Karasan:
Incremental polynomial time dualization of quadratic functions and a subclass of degree-k functions. 251-261 - David Kronus:
Relations between threshold and k-interval Boolean functions. 263-278 - Van Bang Le:
Two characterizations of chain partitioned probe graphs. 279-283 - Miguel A. Lejeune, François Margot:
Optimization for simulation: LAD accelerator. 285-305 - Leo Liberti, Laurent Alfandari, Marie-Christine Plateau:
Edge cover by connected bipartite subgraphs. 307-329 - Vadim V. Lozin:
Stability preserving transformations of graphs. 331-341 - Yannis Marinakis, Magdalene Marinaki, Michael Doumpos, Nikolaos F. Matsatsinis, Constantin Zopounidis:
A hybrid ACO-GRASP algorithm for clustering analysis. 343-358 - Martin Milanic, James B. Orlin, Gábor Rudolf:
Complexity results for equistable graphs and related classes. 359-370 - Daniele Pretolani:
Optimization and probabilistic satisfiability on nested and co-nested formulas. 371-387 - César Rego, Haitao Li, Fred W. Glover:
A filter-and-fan approach to the 2D HP model of the protein folding problem. 389-414 - Jelena Sedlar, Damir Vukicevic, Pierre Hansen:
Using size for bounding expressions of graph invariants. 415-427
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-05-10 18:47 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:
