Computing in combinatorial optimization
type: Item
instance of: scholarly article
title: Computing in combinatorial optimization
zbMATH Open document ID: 1479.90173
DOI: 10.1007/978-3-319-91908-9_3
author: Yanyan Li
publication date: 2022-02-16T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90-02
zbMATH DE Number: 7474171
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: linear programming
zbMATH Keywords: traveling salesman problem
MaRDI profile type: Publication
full work available at URL: 978-3-319-91908-9 3
OpenAlex ID: W2978723903
cites work: Q3425132
cites work: Q4283461
cites work: Q4967193
cites work: Q3241581
cites work: Dynamic Programming Treatment of the Travelling Salesman Problem
cites work: Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex Method
cites work: Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time
cites work: The cutting plane method is polynomial for perfect matchings
cites work: Worst-case analysis of a new heuristic for the travelling salesman problem
cites work: Edmonds polytopes and a hierarchy of combinatorial problems
cites work: Q5586401
cites work: An overview of computational complexity
cites work: Computing Minimum-Weight Perfect Matchings
cites work: Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Paths, Trees, and Flowers
cites work: Q5684698
cites work: Q3137912
cites work: Optimum branchings
cites work: Systems of distinct representatives and linear algebra
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: Separating maximally violated comb inequalities in planar graphs
cites work: The Traveling-Salesman Problem
cites work: Q3292914
cites work: Steepest-edge simplex algorithms for linear programming
cites work: Q3085455
cites work: Worst-case comparison of valid inequalities for the TSP
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: A practicable steepest-edge simplex algorithm
cites work: Outline of an algorithm for integer solutions to linear programs
cites work: On the symmetric travelling salesman problem: Solution of a 120-city problem
cites work: Solution of large-scale symmetric travelling salesman problems
cites work: A Cutting Plane Algorithm for the Linear Ordering Problem
cites work: On the acyclic subgraph polytope
cites work: Facets of the linear ordering polytope
cites work: Geometric algorithms and combinatorial optimization
cites work: George Dantzig's contributions to integer programming
cites work: On the Computational Complexity of Algorithms
cites work: A Dynamic Programming Approach to Sequencing Problems
cites work: The traveling-salesman problem and minimum spanning trees: Part II
cites work: Computational Experience in Solving Linear Programs
cites work: Q5187226
cites work: Approximation algorithms for combinatorial problems
cites work: Q4840772
cites work: Upper bounds for the diameter and height of graphs of convex polyhedra
cites work: Reducibility among Combinatorial Problems
cites work: Q5365067
cites work: An Efficient Heuristic Procedure for Partitioning Graphs
cites work: Optimization by Simulated Annealing
cites work: Blossom V: A new implementation of a minimum cost perfect matching algorithm
cites work: Combinatorial optimization. Theory and algorithms.
cites work: An Automatic Method of Solving Discrete Programming Problems
cites work: Global optimization with polynomials and the problem of moments
cites work: Separating a superclass of comb inequalities in planar graphs
cites work: Computer Solutions of the Traveling Salesman Problem
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Cones of Matrices and Set-Functions and 0–1 Optimization
cites work: Implementation of O ( nm log n ) weighted matchings in general graphs
cites work: Algorithms for the Assignment and Transportation Problems
cites work: Q5817856
cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
cites work: A counterexample to the Hirsch conjecture

Computing in combinatorial optimization (cites work)
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)

Computing in combinatorial optimization (cites work)
cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems

Computing in combinatorial optimization (cites work)
cites work: Smoothed analysis of algorithms

Computing in combinatorial optimization (cites work)
cites work: The Design of Approximation Algorithms

Computing in combinatorial optimization (cites work)
cites work: Q4414647