Works matching IS 00283045 AND DT 2012 AND VI 59 AND IP 1

Results: 15

Network flow methods for electoral systems.

Published in:

Networks, 2012, v. 59, n. 1, p. 73, doi. 10.1002/net.20480

By:

Pukelsheim, Friedrich;
Ricca, Federica;
Simeone, Bruno;
Scozzari, Andrea;
Serafini, Paolo

Publication type:

Article

Improving an interior-point algorithm for multicommodity flows by quadratic regularizations.

Published in:

Networks, 2012, v. 59, n. 1, p. 117, doi. 10.1002/net.20483

By:

Castro, Jordi;
Cuesta, Jordi

Publication type:

Article

Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem.

Published in:

Networks, 2012, v. 59, n. 1, p. 148, doi. 10.1002/net.20485

By:

Uchoa, Eduardo;
Toffolo, Túlio A. M.;
de Souza, Mauricio C.;
Martins, Alexandre X.;
Fukasawa, Ricardo

Publication type:

Article

On the minimum cut separator problem.

Published in:

Networks, 2012, v. 59, n. 1, p. 30, doi. 10.1002/net.20478

By:

Ben-Ameur, Walid;
Didi Biha, Mohamed

Publication type:

Article

On a stochastic bilevel programming problem.

Published in:

Networks, 2012, v. 59, n. 1, p. 107, doi. 10.1002/net.20482

By:

Kosuch, Stefanie;
Le Bodic, Pierre;
Leung, Janny;
Lisser, Abdel

Publication type:

Article

Complexity of column generation in network design with path-based survivability mechanisms.

Published in:

Networks, 2012, v. 59, n. 1, p. 132, doi. 10.1002/net.20484

By:

Orlowski, Sebastian;
Pióro, Michał

Publication type:

Article

The load-distance balancing problem.

Published in:

Networks, 2012, v. 59, n. 1, p. 22, doi. 10.1002/net.20477

By:

Bortnikov, Edward;
Khuller, Samir;
Li, Jian;
Mansour, Yishay;
Naor, Joseph Seffi

Publication type:

Article

Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem.

Published in:

Networks, 2012, v. 59, n. 1, p. 59, doi. 10.1002/net.20488

By:

Klopfenstein, Olivier;
Nace, Dritan

Publication type:

Article

The complexity of the node capacitated in-tree packing problem.

Published in:

Networks, 2012, v. 59, n. 1, p. 13, doi. 10.1002/net.20476

By:

Imahori, Shinji;
Miyamoto, Yuichiro;
Hashimoto, Hideki;
Kobayashi, Yusuke;
Sasaki, Mihiro;
Yagiura, Mutsunori

Publication type:

Article

Recoverable robust shortest path problems.

Published in:

Networks, 2012, v. 59, n. 1, p. 181, doi. 10.1002/net.20487

By:

Büsing, Christina

Publication type:

Article

A quadratic semidefinite relaxation approach for resource allocation in orthogonal frequency division multiple access.

Published in:

Networks, 2012, v. 59, n. 1, p. 3, doi. 10.1002/net.20475

By:

Adasme, Pablo;
Lisser, Abdel;
Soto, Ismael

Publication type:

Article

Exactly solving a two-level location problem with modular node capacities.

Published in:

Networks, 2012, v. 59, n. 1, p. 161, doi. 10.1002/net.20486

By:

Addis, Bernardetta;
Carello, Giuliana;
Ceselli, Alberto

Publication type:

Article

Survivability in hierarchical telecommunications networks.

Published in:

Networks, 2012, v. 59, n. 1, p. 37, doi. 10.1002/net.20479

By:

Fouilhoux, Pierre;
Karasan, Oya Ekin;
Mahjoub, A. Ridha;
Özkök, Onur;
Yaman, Hande

Publication type:

Article

Exact approaches to the single-source network loading problem.

Published in:

Networks, 2012, v. 59, n. 1, p. 89, doi. 10.1002/net.20481

By:

Ljubić, Ivana;
Putz, Peter;
Salazar-González, Juan-José

Publication type:

Article

Editorial.

Published in:

Networks, 2012, v. 59, n. 1, p. 1, doi. 10.1002/net.20474

By:

Gouveia, Luis;
Scutellà, Maria Grazia

Publication type:

Article