Combinatorial optimization. Theory and algorithms.
From MaRDI portal
Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Discrete location and assignment (90B80) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Recommendations
- Combinatorial optimization. Theory and applications.
- Combinatorial optimization. Theory and algorithms.
- Combinatorial optimization. Theory and algorithms. Translated from the English by R. von Randow
- Combinatorial optimization. Theory and algorithms.
- Combinatorial optimization. Theory and algorithms
Cited in
(only showing first 100 items - show all)- On the parallel complexity of constrained read-once refutations in UTVPI constraint systems
- Recent developments in discrete convex analysis
- 1-line minimum rectilinear Steiner trees and related problems
- The k-separator problem: polyhedra, complexity and approximation results
- Refined cut selection for Benders decomposition: applied to network capacity expansion problems
- The hypermetric cone and polytope on eight vertices and some generalizations
- A note on anti-coordination and social interactions
- Graph editing problems with extended regularity constraints
- Combinatorial optimization. Theory and algorithms.
- Three-matching intersection conjecture for perfect matching polytopes of small dimensions
- Gems of combinatorial optimization and graph algorithms
- Subjectively interesting connecting trees and forests
- Adjacencies on random ordering polytopes and flow polytopes
- New approaches to multi-objective optimization
- Combinatorial optimization problems in planning and decision making. Theory and applications
- Fast algorithms for the undirected negative cost cycle detection problem
- A strongly polynomial FPTAS for the symmetric quadratic knapsack problem
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- A comparison of lower bounds for the symmetric circulant traveling salesman problem
- Combinatorial optimization. Theory and algorithms
- ReLU neural networks of polynomial size for exact maximum flow computation
- Combinatorial optimization. Theory and applications.
- Recoverable robust shortest path problems
- An analysis of the extended Christofides heuristic for the \(k\)-depot TSP
- Approximation algorithm for solving the 1-line Steiner tree problem with minimum number of Steiner points
- Embedding evolutionary strategy in ordinal optimization for hard optimization problems
- The minimum centroid branch spanning tree problem
- Finding the maximal adversary structure from any given access structure
- Application of the simulated annealing local search technique to problems of redundancy elimination in functional and parametric tests of integrated circuits
- On the relative complexity of 15 problems related to~0/1-integer programming
- Extended formulations for order polytopes through network flows
- Nonlinear combinatorial optimization
- Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
- A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
- Scheduling with job delivery coordination on single machine
- Affinity and fluctuations in a mesoscopic noria
- Valid inequalities for the topology optimization problem in gas network design
- A note on the single machine scheduling to minimize the number of tardy jobs with deadlines
- On residual approximation in solution extension problems
- Euler complexes
- Virtual private network design over the first Chvátal closure
- Graph Bipartization Problem with Applications to Via Minimization in VLSI Design
- A survey-based approach for designing the lines of a rapid transit network
- Editing graphs to satisfy degree constraints: a parameterized approach
- Maximization of the Choquet integral over a convex set and its application to resource allocation problems
- Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties
- Approximate maximin share allocations in matroids
- scientific article; zbMATH DE number 1198942 (Why is no real title available?)
- The Maximum Flow Problem for Oriented Flows
- Approximation algorithms for solving the 1-line minimum Steiner tree of line segments problem
- An exact algorithm for the line-constrained bottleneck \(k\)-Steiner tree problem
- Connections in combinatorial optimization
- Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem
- Breaking thermaxBarrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem
- scientific article; zbMATH DE number 4083376 (Why is no real title available?)
- An adaptive neurodynamic approach for solving nonsmooth \(N\)-cluster games
- Approximation algorithms for constructing Steiner trees in the Euclidean plane \(\mathbb{R}^2\) using stock pieces of materials with fixed length
- Sufficient pruning conditions for MINLP in gas network design
- Computing minimum cuts by randomized search heuristics
- A polynomial time algorithm for read-once certification of linear infeasibility in UTVPI constraints
- Combinatorial optimization: the interplay of graph theory, linear and integer programming illustrated on network flow
- Improved algorithms for joint optimization of facility locations and network connections
- Formal barriers to simple algorithms for the matroid secretary problem
- Combinatorial optimization. Theory and algorithms. Translated from the English by R. von Randow
- A simple algorithm for multicuts in planar graphs with outer terminals
- Universal Gröbner basis associated with the maximum flow problem
- On the complexity of the selective graph coloring problem in some special classes of graphs
- Steiner networks with unicyclic connected components
- Modelling convex shape priors and matching based on the Gromov-Wasserstein distance
- Generalized network improvement and packing problems
- A moving horizon approach to a noncontinuum state estimation
- Convex reformulations for solving a nonlinear network design problem
- Algorithms for the metric ring star problem with fixed edge-cost ratio
- Stronger instruments via integer programming in an observational study of late preterm birth outcomes
- A Survey on Covering Supermodular Functions
- On cardinality constrained polymatroids
- Generalised \(k\)-Steiner tree problems in normed planes
- An adaptive routing approach for personal rapid transit
- Housing markets through graphs
- The representation polyhedron of a semiorder.
- A partition-based relaxation for Steiner trees
- Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty
- On fixed-parameter solvability of the minimax path location problem
- Matching polytopes and Specht modules
- The Floyd-Warshall algorithm on graphs with negative cycles
- A branch-and-cut algorithm for the ring spur assignment problem
- The Expressive Power of Binary Submodular Functions
- Equilibria in load balancing games
- Nash equilibria and the price of anarchy for flows over time
- On cardinality constrained polymatroids
- Smoothed analysis of the successive shortest path algorithm
- ReLU neural networks of polynomial size for exact maximum flow computation
- Core index of perfect matching polytope for a 2-connected cubic graph
- On graphs with a unique perfect matching
- Seeking global edges for traveling salesman problem in multi-start search
- Bounds on the competence of a homogeneous jury
- Combinatorial optimization. Theory and algorithms.
- On structured output training: hard cases and an efficient alternative
- Privatized rural postman problems
- An introduction to network flows over time
This page was built for publication: Combinatorial optimization. Theory and algorithms.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5920350)
