The SCEAS System
Navigation Menu

Journals in DBLP

Math. Program.
2006, volume: 105, number: 2-3

  1. Thomas M. Liebling, Denis Naddef, Laurence A. Wolsey
    Combinatorial Optimization: Theory and Computation The Aussois Workshop 2004. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:157-160 [Journal]
  2. Michele Conforti, Giacomo Zambelli
    Recognizing Balanceable Matrices. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:161-179 [Journal]
  3. Francisco Barahona
    Network reinforcement. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:181-200 [Journal]
  4. Kathie Cameron, Pavol Hell
    Independent packings in structured graphs. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:201-213 [Journal]
  5. Dennis Michaels, Robert Weismantel
    Polyhedra related to integer-convex polynomial systems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:215-232 [Journal]
  6. Flavia Bonomo, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter
    On Balanced Graphs. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:233-250 [Journal]
  7. Adam N. Letchford, Juan José Salazar González
    Projection results for vehicle routing. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:251-274 [Journal]
  8. Dirk Müller
    On the complexity of the planar directed edge-disjoint paths problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:275-288 [Journal]
  9. Jean Fonlupt, Ali Ridha Mahjoub
    Critical extreme points of the 2-edge connected spanning subgraph polytope. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:289-310 [Journal]
  10. Arnaud Pêcher, Annegret Wagler
    Almost all webs are not rank-perfect. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:311-328 [Journal]
  11. Denis Cornaz
    A linear programming formulation for the maximum complete multipartite subgraph problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:329-344 [Journal]
  12. Agostinho Agra, Miguel Fragoso Constantino
    Polyhedral description of the integer single node flow set with constant bounds. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:345-364 [Journal]
  13. Rüdiger Schultz, Stephan Tiedemann
    Conditional Value-at-Risk in Stochastic Programs with Mixed-Integer Recourse. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:365-386 [Journal]
  14. Ernst Althaus, Alberto Caprara, Hans-Peter Lenhof, Knut Reinert
    A branch-and-cut algorithm for multiple sequence alignment. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:387-425 [Journal]
  15. Ivana Ljubic, René Weiskircher, Ulrich Pferschy, Gunnar W. Klau, Petra Mutzel, Matteo Fischetti
    An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:427-449 [Journal]
  16. Ilse Fischer, Gerald Gruber, Franz Rendl, Renata Sotirov
    Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and Equipartition. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:451-469 [Journal]
  17. Roberto De Franceschi, Matteo Fischetti, Paolo Toth
    A new ILP-based refinement heuristic for Vehicle Routing Problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:471-499 [Journal]
  18. Mathieu Van Vyve, Laurence A. Wolsey
    Approximate extended formulations. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:501-522 [Journal]
  19. S. Shebalov, Diego Klabjan
    Sequence Independent Lifting for Mixed Integer Programs with Variable Upper Bounds. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:523-561 [Journal]
  20. Alexander Martin, Markus Möller, Susanne Moritz
    Mixed Integer Models for the Stationary Case of Gas Network Optimization. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:563-582 [Journal]
  21. Juan José Salazar González
    Controlled rounding and cell perturbation: statistical disclosure limitation methods for tabular data. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:583-603 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002