Recent trends in combinatorial optimization
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3121293 (Why is no real title available?)
- scientific article; zbMATH DE number 3845539 (Why is no real title available?)
- scientific article; zbMATH DE number 3850828 (Why is no real title available?)
- scientific article; zbMATH DE number 3858856 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3869347 (Why is no real title available?)
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 3703542 (Why is no real title available?)
- scientific article; zbMATH DE number 3749025 (Why is no real title available?)
- scientific article; zbMATH DE number 3756243 (Why is no real title available?)
- scientific article; zbMATH DE number 3779067 (Why is no real title available?)
- scientific article; zbMATH DE number 3779123 (Why is no real title available?)
- scientific article; zbMATH DE number 3475221 (Why is no real title available?)
- scientific article; zbMATH DE number 3475463 (Why is no real title available?)
- scientific article; zbMATH DE number 3509333 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3544074 (Why is no real title available?)
- scientific article; zbMATH DE number 3580570 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3227800 (Why is no real title available?)
- scientific article; zbMATH DE number 3314878 (Why is no real title available?)
- scientific article; zbMATH DE number 3323651 (Why is no real title available?)
- scientific article; zbMATH DE number 3376984 (Why is no real title available?)
- scientific article; zbMATH DE number 3400923 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- scientific article; zbMATH DE number 3026247 (Why is no real title available?)
- A Minimal Totally Dual Integral Defining System for the b-Matching Polyhedron
- A Minimax Theorem for Directed Graphs
- A combinatorial abstraction of linear programming
- A generalization of max flow—min cut
- A network simplex method
- A restricted Lagrangean approach to the traveling salesman problem
- A submodular network simplex method
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Algorithmic versus axiomatic definitions of matroids
- Algorithms for Scheduling Independent Tasks
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- An Algorithm for Submodular Functions on Graphs
- An Analysis of the Greedy Heuristic for Independence Systems
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An \(O(IVI^3)\) algorithm for finding maximum flows in networks
- An analysis of approximations for maximizing submodular set functions—I
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
- Canonical decompositions of symmetric submodular systems
- Combinatorial Optimization: What is the State of the Art
- Convexity in oriented matroids
- Decomposition of regular matroids
- Edmonds polytopes and weakly hamiltonian graphs
- Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Facets of the linear ordering polytope
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Integer programming and related areas. A classified bibliography
- Integer programming and related areas. A classified bibliography 1976- 1978. Compiled at the Institut für Ökonometrie und Operations Research, University of Bonn
- Integer programming and related areas. A classified bibliography 1978-1981. Compiled at the Institut für Ökonometrie und Operations Research, University of Bonn
- Introduction to the theory of matroids
- Linear growth: a unifying approach to linear systems of difference and differential equations
- Matroid Intersection
- Matroid intersection algorithms
- Matroids and the greedy algorithm
- Maximal Flow Through a Network
- Maximum matching and a polyhedron with 0,1-vertices
- Methods of Nonlinear 0-1 Programming
- Odd Minimum Cut-Sets and b-Matchings
- On Linear Characterizations of Combinatorial Optimization Problems
- On a classification of independence systems
- On maximal independent sets of vertices in claw-free graphs
- On the Abstract Properties of Linear Dependence
- On the symmetric travelling salesman problem II: Lifting theorems and facets
- On the symmetric travelling salesman problem: Solution of a 120-city problem
- On total dual integrality
- Optimum matching forests I: Special weights
- Optimum matching forests II: General weights
- Orientability of matroids
- Oriented matroids
- Regular (2, 2)-systems
- Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex Method
- The ellipsoid method and its consequences in combinatorial optimization
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Total dual integrality and b-matchings
- Total dual integrality and integer polyhedra
Cited in
(18)- The new faces of combinatorial optimization
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Connections in combinatorial optimization. I: optimization in graphs
- Research trends in combinatorial optimization
- On the computational complexity of combinatorial flexibility problems
- Convex combinatorial optimization
- Polyhedral approaches
- scientific article; zbMATH DE number 3887435 (Why is no real title available?)
- scientific article; zbMATH DE number 3902672 (Why is no real title available?)
- Matroids and combinatorial optimisation
- scientific article; zbMATH DE number 792643 (Why is no real title available?)
- Combinatorial Optimization Problems with Soft and Hard Requirements
- scientific article; zbMATH DE number 4083376 (Why is no real title available?)
- Data Collection for the Sloan Digital Sky Survey—A Network-Flow Heuristic
- scientific article; zbMATH DE number 4114386 (Why is no real title available?)
- Advances in combinatorial optimization
- scientific article; zbMATH DE number 4156211 (Why is no real title available?)
- Meaningfulness of conclusions from combinatorial optimization
This page was built for publication: Recent trends in combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q788638)
