Items where Subject is "90-XX Operations research, mathematical programming > 90Bxx Operations research and management science > 90B10 Network models, deterministic"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Authors | Item Type
Jump to: C | E | F | G | K | M | Z | Á
Number of items at this level: 14.

C

Cacchiani, Valentina and Jünger, Michael and Liers, Frauke and Lodi, Andrea and Schmidt, Daniel R. (2014) Single-Commodity Robust Network Design with Finite and Hose Demand Sets.
Technical Report , 32 p.
Submitted

Cacchiani, Valentina and Jünger, Michael and Liers, Frauke and Lodi, Andrea and Schmidt, Daniel R. (2016) Single-commodity robust network design with finite and Hose demand sets.
Published in: Mathematical Programming Vol. 157 (1). pp. 297-342. ISSN 0025-5610

E

Engels, Birgit and Krumke, Sven and Schrader, Rainer and Zeck, Christiane (2009) Integer Flow with Multipliers: The Special Case of Multipliers 1 and 2.
Published In: Proceedings of the 8th Cologne Twente Workshop on Graphs and Combinatorial Optimization 2009, pp. 239-243.

Engels, Birgit and Schrader, Rainer (2015) Freight car dispatching with generalized flows.
Published in: Networks Vol. 66 (1). pp. 33-39. ISSN 1097-0037

F

Fekete, Sandor P. and Khuller, Samir and Klemmstein, Monika and Raghavachari, Balaji and Young, Neal (1996) A network-flow technique for finding low-weight bounded-degree spanning trees.
Published In: Integer programming and combinatorial optimization : 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3 - 5, 1996 ; proceedings, Lecture notes in computer science. 1084 Springer 1996, pp. 105-117.

Fekete, Sandor P. and Khuller, Samir and Klemmstein, Monika and Raghavachari, Balaji and Young, Neal (1997) A network-flow technique for finding low-weight bounded-degree spanning trees.
Published in: Journal of Algorithms Vol. 24 (2). pp. 310-324.

Fekete, Sandor P. and Klemmstein, Monika (1995) Worst-case ratios for degree-constrained trees.
Published In: Proceedings of the 4th Biannual Twente Workshop on Graph Theory and Discrete Optimization 1995, pp. 103-106.

G

Grötschel, Martin and Jünger, Michael and Reinelt, Gerhard (1987) Calculating exact Ground States of Spin Glasses: A Polyhedral Approach.
Published In: Heidelberg Colloquium on Glassy Dynamics : proceedings of a Colloquium on Spin Glasses, Optimization and Neural Networks, held at the Univ. of Heidelberg, June 9 - 13, 1986, Lecture Notes in Physics. 275 Springer 1987, 325 -353 .

K

Knab, Bernhard and Schrader, Rainer and Weber, Iris and Weinbrecht, Karin and Wichern, Bernd (1997) Mesoskopisches Simulationsmodell zur Kollektivfortschreibung.
Technical Report , 10 p.

M

Moll, Christoph (1995) Das inverse Kürzeste-Wege-Problem. ["eprint_fieldopt_thesis_type_phd" not defined] thesis.

Z

Zimmermann, Uwe (1986) Duality for balanced submodular flows.
Published in: Discrete applied mathematics Vol. 15 (2-3). pp. 365-376.

Zimmermann, Uwe (1984) Submodulare Flüsse: Verfahren zur Minimierung linearer Zielfunktionen.
Technical Report , 40 p.

Á

Álvarez-Miranda, Eduardo and Cacchiani, Valentina and Dorneth, Tim and Jünger, Michael and Liers, Frauke and Lodi, Andrea and Parriani, Tiziano and Schmidt, Daniel R. (2012) Models and Algorithms for Robust Network Design with Several Traffic Scenarios.
Published In: Combinatorial Optimization : Second International Symposium, ISCO 2012, Athens, Greece, April 19-21, 2012, Revised Selected Papers, Lecture notes in computer science. 7422 Springer-Verlag 2012, pp. 261-272.

Álvarez-Miranda, Eduardo and Cacchiani, Valentina and Lodi, Andrea and Parriani, Tiziano and Schmidt, Daniel R. (2014) Single-commodity robust network design problem: Complexity, instances and heuristic solutions.
Published in: European Journal of Operational Research Vol. 238 (3). pp. 711-723. ISSN 0377-2217

This list was generated on Mon Oct 23 07:45:22 2017 CEST.