Recent trends in combinatorial optimization
type: Item
instance of: scholarly article
title: Recent trends in combinatorial optimization
zbMATH Open document ID: 0531.90073
DOI: 10.1007/BF01721246
published in: OR Spektrum
publication date: 1984-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90-02
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 52Bxx
Mathematics Subject Classification ID: 05B35
zbMATH DE Number: 3843503
zbMATH Keywords: survey
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: complexity theory
zbMATH Keywords: matroid
zbMATH Keywords: matching
zbMATH Keywords: network flow
zbMATH Keywords: submodular functions
zbMATH Keywords: heuristic algorithms
author: Achim Bachem
author: Reinhardt Euler
MaRDI profile type: Publication
cites work: Q3939599
cites work: Q3315472
cites work: Q3337482
cites work: A restricted Lagrangean approach to the traveling salesman problem
cites work: A submodular network simplex method
cites work: Q5668821
cites work: A combinatorial abstraction of linear programming
cites work: Orientability of matroids
cites work: Q3852212
cites work: Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex Method
cites work: Q5648149
cites work: Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
cites work: Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme
cites work: Edmonds polytopes and weakly hamiltonian graphs
cites work: A Minimal Totally Dual Integral Defining System for the b-Matching Polyhedron
cites work: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
cites work: A network simplex method
cites work: Q3932816
cites work: Q3958239
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Q5684698
cites work: Matroids and the greedy algorithm
cites work: Matroid Intersection
cites work: Q4149476
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: Regular (2, 2)-systems
cites work: On a classification of independence systems
cites work: Linear growth: a unifying approach to linear systems of difference and differential equations
cites work: Oriented matroids
cites work: Maximal Flow Through a Network
cites work: An Algorithm for Submodular Functions on Graphs
cites work: Canonical decompositions of symmetric submodular systems
cites work: Optimum matching forests I: Special weights
cites work: Optimum matching forests II: General weights
cites work: Total dual integrality and integer polyhedra
cites work: Q3328583
cites work: On the symmetric travelling salesman problem: Solution of a 120-city problem
cites work: Facets of the linear ordering polytope
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: On the symmetric travelling salesman problem II: Lifting theorems and facets
cites work: Q3958289
cites work: Methods of Nonlinear 0-1 Programming
cites work: Integer programming and related areas. A classified bibliography 1976- 1978. Compiled at the Institut für Ökonometrie und Operations Research, University of Bonn
cites work: Algorithmic versus axiomatic definitions of matroids
cites work: A generalization of max flow—min cut
cites work: Q3236252
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: Q5595961
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: Q4119222
cites work: On Linear Characterizations of Combinatorial Optimization Problems
cites work: Q4058442
cites work: Integer programming and related areas. A classified bibliography
cites work: Combinatorial Optimization: What is the State of the Art
cites work: Q3328285
cites work: An Analysis of the Greedy Heuristic for Independence Systems

Recent trends in combinatorial optimization (cites work)
cites work: Q3320130

Recent trends in combinatorial optimization (cites work)
cites work: Q4058679

Recent trends in combinatorial optimization (cites work)
cites work: Convexity in oriented matroids

Recent trends in combinatorial optimization (cites work)
cites work: Matroid intersection algorithms

Recent trends in combinatorial optimization (cites work)
cites work: Q3048571

Recent trends in combinatorial optimization (cites work)
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem

Recent trends in combinatorial optimization (cites work)
cites work: Q3896158

Recent trends in combinatorial optimization (cites work)
cites work: A Minimax Theorem for Directed Graphs

Recent trends in combinatorial optimization (cites work)
cites work: An \(O(IVI^3)\) algorithm for finding maximum flows in networks

Recent trends in combinatorial optimization (cites work)
cites work: Q5516084

Recent trends in combinatorial optimization (cites work)
cites work: On maximal independent sets of vertices in claw-free graphs

Recent trends in combinatorial optimization (cites work)
cites work: An analysis of approximations for maximizing submodular set functions—I

Recent trends in combinatorial optimization (cites work)
cites work: Odd Minimum Cut-Sets and b-Matchings

Recent trends in combinatorial optimization (cites work)
cites work: Q4739657

Recent trends in combinatorial optimization (cites work)
cites work: Total dual integrality and b-matchings

Recent trends in combinatorial optimization (cites work)
cites work: Integer programming and related areas. A classified bibliography 1978-1981. Compiled at the Institut für Ökonometrie und Operations Research, University of Bonn

Recent trends in combinatorial optimization (cites work)
cites work: Introduction to the theory of matroids

Recent trends in combinatorial optimization (cites work)
cites work: Algorithms for Scheduling Independent Tasks

Recent trends in combinatorial optimization (cites work)
cites work: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé

Recent trends in combinatorial optimization (cites work)
cites work: On total dual integrality

Recent trends in combinatorial optimization (cites work)
cites work: Decomposition of regular matroids

Recent trends in combinatorial optimization (cites work)
cites work: Q4089424

Recent trends in combinatorial optimization (cites work)
cites work: Q5603731

Recent trends in combinatorial optimization (cites work)
cites work: Q5766357

Recent trends in combinatorial optimization (cites work)
cites work: Q4111952

Recent trends in combinatorial optimization (cites work)
cites work: On the Abstract Properties of Linear Dependence

Recent trends in combinatorial optimization (full work available at URL)
full work available at URL: https://doi.org/10.1007/bf01721246

Recent trends in combinatorial optimization (OpenAlex ID)
OpenAlex ID: W1968427513