Combinatorial optimization. Networks and matroids

Publication date 13 May 2001

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Combinatorial aspects of matroids and geometric lattices (05B35) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

Matroids and combinatorial optimisation
scientific article; zbMATH DE number 4027489
scientific article; zbMATH DE number 2159270
scientific article; zbMATH DE number 863480
Connections in combinatorial optimization. I: optimization in graphs
Combinatorial optimization: the interplay of graph theory, linear and integer programming illustrated on network flow
scientific article; zbMATH DE number 2205254
Combinatorial optimization and graph algorithms. Communications of NII Shonan meetings
Combinatorial network theory
Publication:4729618

Cited in

(69)

Random matroids
The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm
A new saling algorithm for the maximum mean cut problem
Heuristic and exact algorithms for the simultaneous assignment problem
A connection between sports and matroids: how many teams can we beat?
A new matching property for posets and existence of disjoint chains
Algorithms for synthesizing mechanical systems with maximal natural frequencies
Geometric lattice structure of covering-based rough sets through matroids
The order properties and Karcher barycenters of probability measures on the open convex cone
Putting continuous metaheuristics to work in binary search spaces
Go with the flow, on Jupiter and snow. Coherence from model-free video data without trajectories
On a conjecture for the university timetabling problem
Managing risk-adjusted resource allocation for project time-cost tradeoffs
Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers
An approximation algorithm for a general class of parametric optimization problems
Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems
Solving a class of feature selection problems via fractional 0--1 programming
\(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem
An FPTAS for the knapsack problem with parametric weights
A fast parallel algorithm for minimum-cost small integral flows
The electric vehicle shortest-walk problem with battery exchanges
An FPTAS for the parametric knapsack problem
Competitive weighted matching in transversal matroids
On the connectivity preserving minimum cut problem
Constrained hitting set problem with intervals
Colored-edge graph approach for the modeling of multimodal transportation systems
Efficient algorithms for a simple network design problem
Covers of Query Results
Looking for edge-equitable spanning trees
On an exact method for the constrained shortest path problem
Approximating the Stochastic Network by its M Shortest Paths
Affirmative action algorithms
On the cores of games arising from integer edge covering functions of graphs
An approximation algorithm for the three depots Hamiltonian path problem
Reformulating linear programs with transportation constraints-With applications to workforce scheduling
Covering cycle matroid
Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow
On the generality of the greedy algorithm for solving matroid base problems
Recognizing Even-Cycle and Even-Cut Matroids
Logical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem
Subset matching and edge coloring in bipartite graphs
Bicriteria data compression
The color-balanced spanning tree problem.
Recognizing even-cycle and even-cut matroids
On polynomially solvable constrained input selections for fixed and switched linear structured systems
Time–cost trade-off in a multi-choice assignment problem
Mixed integer bilevel optimization with a k-optimal follower: a hierarchy of bounds
COVERING GRAPHS WITH OPTIMAL COLLECTION OF EDGES
Solving maximum weighted matching on large graphs with deep reinforcement learning
Constrained hitting set problem with intervals: hardness, FPT and approximation algorithms
On generalized balanced optimization problems
Interleaving by parts: join decompositions of interleavings and join-assemblage of geodesics
1-Approximation algorithm for bottleneck disjoint path matching
A generalized approximation framework for fractional network flow and packing problems
Rerandomization Algorithms for Optimal Designs of Network A/B Tests
Approximation algorithms for multiple terminal, Hamiltonian path problems
3-approximation algorithm for a two depot, heterogeneous traveling salesman problem
A survey of exact and approximation algorithms for linear-parametric optimization problems
Flow-shop and job-shop robust scheduling problems with budgeted uncertainty
Market design with deferred acceptance: a recipe for characterizations
On the k-maximally-disjoint weighted spanning trees problem: variants, complexity and algorithms
The complexity of finding fair many-to-one matchings
On some geometric optimization problems with segments
Total domination and open packing in two subclasses of triangle-free graphs
On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems
Shunting minimal rail car allocation
Nullity-based matroid of rough sets and its application to attribute reduction
Solving k-shortest and constrained shortest path problems efficiently
Inferring (biological) signal transduction networks via transitive reductions of directed graphs

This page was built for publication: Combinatorial optimization. Networks and matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2718910)