Items where Subject is "90-XX Operations research, mathematical programming > 90Cxx Mathematical programming > 90C60 Abstract computational complexity for mathematical programming problems"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Authors | Item Type
Jump to: B | F | G | H
Number of items at this level: 4.


Blasum, Ulrich and Bussieck, M. and Hochstättler, Winfried and Moll, Christoph and Scheel, Hans-Helmut and Winter, Thomas (1999) Scheduling Trams in the Morning.
Published in: Mathematical Methods of Operations Research Vol. 49 (1). pp. 137-148.


Faigle, Ulrich and Fekete, Sandor P. and Hochstättler, Winfried and Kern, Walter (1997) On the Complexity of Testing Membership in the Core of Min-cost Spanning Tree Games.
Published in: International Journal of Game Theory Vol. 26 (3). pp. 361-366.


Gassner, Elisabeth and Percan, Merijam (2006) On the Weighted Minimal Deletion of Rooted Bipartite Minors.
Technical Report , 35 p.


Hohmann, C. and Kern, Walter (1990) Optimization and optimality test for the Max-Cut Problem.
Published in: Zeitschrift für Operations-Research : ZOR ; mathematical methods of operations research Vol. 34 (3). pp. 195-206.

This list was generated on Sun Mar 7 15:38:58 2021 CET.