Computing in combinatorial optimization
From MaRDI portal
Publication:2075761
DOI10.1007/978-3-319-91908-9_3zbMath1479.90173OpenAlexW2978723903MaRDI QIDQ2075761
Publication date: 16 February 2022
Full work available at URL: https://doi.org/10.1007/978-3-319-91908-9_3
Linear programming (90C05) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (2)
A landscape-based analysis of fixed temperature and simulated annealing ⋮ Research trends in combinatorial optimization
Cites Work
- 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
- Optimization by Simulated Annealing
- A counterexample to the Hirsch conjecture
- Blossom V: A new implementation of a minimum cost perfect matching algorithm
- Solution of large-scale symmetric travelling salesman problems
- George Dantzig's contributions to integer programming
- Upper bounds for the diameter and height of graphs of convex polyhedra
- Geometric algorithms and combinatorial optimization
- Approximation algorithms for combinatorial problems
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Steepest-edge simplex algorithms for linear programming
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Worst-case comparison of valid inequalities for the TSP
- Worst-case analysis of a new heuristic for the travelling salesman problem
- Edmonds polytopes and a hierarchy of combinatorial problems
- Global Optimization with Polynomials and the Problem of Moments
- Separating Maximally Violated Comb Inequalities in Planar Graphs
- Separating a Superclass of Comb Inequalities in Planar Graphs
- The Cutting Plane Method is Polynomial for Perfect Matchings
- The Design of Approximation Algorithms
- A Cutting Plane Algorithm for the Linear Ordering Problem
- Algorithms for the Assignment and Transportation Problems
- Outline of an algorithm for integer solutions to linear programs
- An Automatic Method of Solving Discrete Programming Problems
- Dynamic Programming Treatment of the Travelling Salesman Problem
- A Dynamic Programming Approach to Sequencing Problems
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Smoothed analysis of algorithms
- On the acyclic subgraph polytope
- Facets of the linear ordering polytope
- An overview of computational complexity
- On the symmetric travelling salesman problem: Solution of a 120-city problem
- A practicable steepest-edge simplex algorithm
- Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
- Some Distribution-Independent Results About the Asymptotic Order of the Average Number of Pivot Steps of the Simplex Method
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- An Efficient Heuristic Procedure for Partitioning Graphs
- Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Computing Minimum-Weight Perfect Matchings
- Reducibility among Combinatorial Problems
- On the Computational Complexity of Algorithms
- Paths, Trees, and Flowers
- Solution of a Large-Scale Traveling-Salesman Problem
- The Traveling-Salesman Problem
- Implementation of O ( nm log n ) weighted matchings in general graphs
- Computer Solutions of the Traveling Salesman Problem
- Maximum matching and a polyhedron with 0,1-vertices
- Optimum branchings
- Systems of distinct representatives and linear algebra
- The traveling-salesman problem and minimum spanning trees: Part II
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Computational Experience in Solving Linear Programs
- Combinatorial optimization. Theory and algorithms.
This page was built for publication: Computing in combinatorial optimization
