scientific article
From MaRDI portal
Publication:2718910
zbMath1058.90057MaRDI QIDQ2718910
Publication date: 13 May 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Combinatorial aspects of matroids and geometric lattices (05B35) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01)
Related Items
The electric vehicle shortest-walk problem with battery exchanges, An FPTAS for the parametric knapsack problem, Recognizing Even-Cycle and Even-Cut Matroids, A new matching property for posets and existence of disjoint chains, Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow, Logical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem, On the connectivity preserving minimum cut problem, Affirmative action algorithms, Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers, Looking for edge-equitable spanning trees, An approximation algorithm for a general class of parametric optimization problems, On an exact method for the constrained shortest path problem, Covers of Query Results, Algorithms for synthesizing mechanical systems with maximal natural frequencies, On the cores of games arising from integer edge covering functions of graphs, 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, An Approximation Algorithm for the Three Depots Hamiltonian Path Problem, COVERING GRAPHS WITH OPTIMAL COLLECTION OF EDGES, Solving maximum weighted matching on large graphs with deep reinforcement learning, On generalized balanced optimization problems, Competitive weighted matching in transversal matroids, Nullity-based matroid of rough sets and its application to attribute reduction, Constrained hitting set problem with intervals: hardness, FPT and approximation algorithms, A connection between sports and matroids: how many teams can we beat?, Constrained hitting set problem with intervals, Geometric lattice structure of covering-based rough sets through matroids, Solving k-shortest and constrained shortest path problems efficiently, Covering cycle matroid, Inferring (biological) signal transduction networks via transitive reductions of directed graphs, Mixed integer programming formulations for Steiner tree and quality of service multicast tree problems, On the generality of the greedy algorithm for solving matroid base problems, 1-Approximation algorithm for bottleneck disjoint path matching, Solving a class of feature selection problems via fractional 0--1 programming, Subset matching and edge coloring in bipartite graphs, The order properties and Karcher barycenters of probability measures on the open convex cone, A generalized approximation framework for fractional network flow and packing problems, Reformulating linear programs with transportation constraints-With applications to workforce scheduling, Approximation algorithms for multiple terminal, Hamiltonian path problems, 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem, Putting continuous metaheuristics to work in binary search spaces, Random matroids, \(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem, Go with the flow, on Jupiter and snow. Coherence from model-free video data without trajectories, On a conjecture for the university timetabling problem, Colored-Edge Graph Approach for the Modeling of Multimodal Transportation Systems, An FPTAS for the knapsack problem with parametric weights, Efficient algorithms for a simple network design problem, The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm, Unnamed Item, Heuristic and exact algorithms for the simultaneous assignment problem, Bicriteria Data Compression, Approximating the Stochastic Network by its M Shortest Paths, On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems, Managing risk-adjusted resource allocation for project time-cost tradeoffs, A new saling algorithm for the maximum mean cut problem, Shunting minimal rail car allocation, A fast parallel algorithm for minimum-cost small integral flows
