Items where Subject is "90-XX Operations research, mathematical programming > 90Cxx Mathematical programming > 90C05 Linear programming"
![]() | Up a level |
- MSC Classification Numbers (27)
- 90-XX Operations research, mathematical programming (27)
- 90Cxx Mathematical programming (27)
- 90C05 Linear programming (27)
- 90Cxx Mathematical programming (27)
- 90-XX Operations research, mathematical programming (27)
B
Bachem, Achim
(1983)
Convexity and optimization in discrete structures.
Published in:
Convexity and its applications. Birkhäuser 1983, pp. 9-29.
Bachem, Achim and Kern, Walter (1992) Linear Programming Duality : An Introduction to Oriented Matroids. Universitext . Springer, Berlin .
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.
D
Derigs, Ulrich and Goecke, Oskar and Schrader, Rainer
(1986)
Monge sequences and a simple assignment algorithm.
Published in:
Discrete Applied Mathematics Vol. 15 (2-3).
pp. 241-248.
G
Gärtner, Bernd and Kaibel, Volker
(1998)
Abstract Objective Function Graphs on the 3-cube: A Classification by Realizability.
Technical Report
, 12 p.
H
Hochstättler, Winfried
(1993)
A Note on the Weak-Zone-Theorem.
Published in:
Congressus Numerantium Vol. 98.
pp. 95-103.
Hochstättler, Winfried (1992) Seitenflächenverbände orientierter Matroide. PhD thesis.
Hochstättler, Winfried and Nesetril, Jaroslav
(1996)
Farkas' Lemma and Morphism Duality.
Technical Report
, 12 p.
Hochstättler, Winfried and Nesetril, Jaroslav
(1999)
Linear Programming Duality and Morphisms.
Published in:
Commentationes mathematicae Universitatis Carolinae : CMUC Vol. 40 (3).
pp. 577-592.
J
Jünger, Michael and Mallach, Sven (2020) Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization.
Jünger, Michael and Mallach, Sven
(2019)
Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization.
Published In:
27th Annual European Symposium on Algorithms (ESA 2019), Lipics. Dagstuhl Publishing 6 September 2019, 63:1-63:13.
K
Kern, Walter
(1986)
An Efficient Algorithm for Solving a Special Class of LP's.
Published in:
Computing : archives for scientific computing Vol. 37 (3).
pp. 219-226.
Korte, Bernhard and Schrader, Rainer
(1984)
Can the ellipsoid method be efficient?
Published in:
Operations Research and Economic Theory : Essays in Honor of Martin J. Beckmann. Springer 1984.
Korte, Bernhard and Schrader, Rainer
(1981)
A note on convergence proof for Shor-Khachian methods.
Published In:
Optimization and Optimal Control : proceedings of a conference held at Oberwolfach, March 16-22, 1980, Lecture Notes in Control and Information Sciences. 30 Springer 1981, pp. 51-57.
Kropat, E. and Pickl, Stefan and Rössler, A. and Weber, Gerhard-Wilhelm
(2000)
A New Algorithm From Semi-Infinite Optimization For a Problem Of Time-Minimal Control.
Published in:
Vycislitel'nye technologii : zurnal = Computational Technologies Vol. 5 (4).
pp. 67-81.
L
Lückerath, Daniel and Ullrich, Oliver and Kupicha, Aleksander and Speckenmeyer, Ewald
(2014)
Multi-depot multi-vehicle-type vehicle scheduling for Cologne’s tram network.
Published In:
Proceedings of ASIM-Workshop STS/GMMS 2014, ASIM Mitteilungen. AM 149 ARGESIM/ASIM Pub., TU Vienna/Austria, Scheible, J.; Bausch-Gall, I.; Deatcu, C. (Ed.) February 2014, pp. 191-197.
M
Mallach, Sven
(2018)
Compact Linearization for Binary Quadratic Problems Comprising Linear Constraints.
Technical Report
, 16 p.
Mallach, Sven
(2017)
Compact Linearization for Binary Quadratic Problems subject to Linear Equations.
Technical Report
, 10 p.
Mallach, Sven
(2017)
Compact linearization for binary quadratic problems subject to assignment constraints.
Published in:
4OR : Quarterly Journal of Operations Research.
pp. 1-14.
ISSN 1614-2411
Mallach, Sven
(2020)
Inductive linearization for binary quadratic programs with
linear constraints.
Published in:
4OR : Quarterly Journal of Operations Research.
pp. 1-23.
Mallach, Sven
(2017)
Linear Ordering Based MIP Formulations for the Vertex Separation or Pathwidth Problem.
Published In:
Combinatorial Algorithms : 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers, Lecture Notes in Computer Science. 10765 Springer 2017, pp. 327-340.
Mallach, Sven
(2018)
Linear Ordering Based MIP Formulations for the Vertex Separation or Pathwidth Problem.
Published in:
Journal of Discrete Algorithms.
N
Neuhaus, Stefan (2009) Eigenschaften kleinster dominierender Mengen und Dominanzzahlen von Damengraphen. PhD thesis.
P
Pickl, Stefan and Weber, Gerhard-Wilhelm
(2000)
An Algorithmic Approach by Linear Programming Problems In Generalized Semi-Infinite Optimization.
Published in:
Vycislitel'nye technologii : zurnal = Computational technologies Vol. 5 (3).
pp. 62-82.
S
Schmidt, Daniel R. and Zey, Bernd and Margot, François
(2017)
MIP Formulations for the Steiner Forest Problem.
Technical Report
, 29 p.
Schrader, Rainer
(1982)
Ellipsoid methods.
Published In:
Modern applied mathematics : optimization and operations research ; collection of state-of-the-art surveys based on lectures presented at the Summer School "Optimization and Operations Research", held at the Univ. of Bonn, September 14 - 22, 1979 North Holland 1982, pp. 265-311.
W
Wanka, Alfred (1986) Matroiderweiterungen zur Existenz endlicher LP-Algorithmen, von Hahn-Banach-Sätzen und Polarität in orientierten Matroiden. PhD thesis.