Recent trends in combinatorial optimization
From MaRDI portal
Publication:788638
DOI10.1007/BF01721246zbMath0531.90073OpenAlexW1968427513MaRDI QIDQ788638
Publication date: 1984
Published in: OR Spektrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01721246
surveycombinatorial optimizationmatchingheuristic algorithmsmatroidnetwork flowcomplexity theorysubmodular functions
Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Combinatorial aspects of matroids and geometric lattices (05B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Polytopes and polyhedra (52Bxx)
Cites Work
- Total dual integrality and integer polyhedra
- Canonical decompositions of symmetric submodular systems
- On maximal independent sets of vertices in claw-free graphs
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
- Convexity in oriented matroids
- Decomposition of regular matroids
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- On total dual integrality
- Integer programming and related areas. A classified bibliography 1978-1981. Compiled at the Institut für Ökonometrie und Operations Research, University of Bonn
- Total dual integrality and b-matchings
- The ellipsoid method and its consequences in combinatorial optimization
- Introduction to the theory of matroids
- Oriented matroids
- Integer programming and related areas. A classified bibliography
- Orientability of matroids
- A combinatorial abstraction of linear programming
- Integer programming and related areas. A classified bibliography 1976- 1978. Compiled at the Institut für Ökonometrie und Operations Research, University of Bonn
- An \(O(IVI^3)\) algorithm for finding maximum flows in networks
- On the symmetric travelling salesman problem II: Lifting theorems and facets
- Matroid Intersection
- A submodular network simplex method
- Maximal Flow Through a Network
- Linear growth: a unifying approach to linear systems of difference and differential equations
- A Minimal Totally Dual Integral Defining System for the b-Matching Polyhedron
- Facets of the linear ordering polytope
- Methods of Nonlinear 0-1 Programming
- Combinatorial Optimization: What is the State of the Art
- On the symmetric travelling salesman problem: Solution of a 120-city problem
- Algorithmic versus axiomatic definitions of matroids
- A restricted Lagrangean approach to the traveling salesman problem
- Optimum matching forests I: Special weights
- Optimum matching forests II: General weights
- Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex Method
- Odd Minimum Cut-Sets and b-Matchings
- Matroid intersection algorithms
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Algorithms for Scheduling Independent Tasks
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- A network simplex method
- Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme
- A generalization of max flow—min cut
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- An analysis of approximations for maximizing submodular set functions—I
- A Minimax Theorem for Directed Graphs
- An Analysis of the Greedy Heuristic for Independence Systems
- An Algorithm for Submodular Functions on Graphs
- Regular (2, 2)-systems
- On Linear Characterizations of Combinatorial Optimization Problems
- On the Abstract Properties of Linear Dependence
- Maximum matching and a polyhedron with 0,1-vertices
- Matroids and the greedy algorithm
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Edmonds polytopes and weakly hamiltonian graphs
- On a classification of independence systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
