The following pages link to (Q3048571):
Displaying 50 items.
- New scaling algorithms for the assignment and minimum mean cycle problems (Q1190599) (← links)
- A dynamic programming solution of a shortest path problem with time constraints on movement and parking (Q1191781) (← links)
- Negative circuits for flows and submodular flows (Q1192951) (← links)
- Path-matching problems (Q1193516) (← links)
- The complexity of computing a best response automaton in repeated games with mixed strategies (Q1193774) (← links)
- Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs (Q1194341) (← links)
- Delay structure conditions for identifiability of closed loop systems (Q1194927) (← links)
- Minimal cut cover of a graph with an application to the testing of electronic boards (Q1195870) (← links)
- A combinatorial interior point method for network flow problems (Q1196185) (← links)
- Crashing a maximum-weight complementary basis (Q1196719) (← links)
- Auction algorithms for network flow problems: A tutorial introduction (Q1202585) (← links)
- A note on the \(f\)-factor-lattice of bipartite graphs (Q1204470) (← links)
- A hierarchical algorithm for making sparse matrices sparser (Q1207308) (← links)
- Linear algorithms for testing the sign stability of a matrix and for finding Z-maximum matchings in acyclic graphs (Q1234553) (← links)
- Matroids, generalized networks, and electric network synthesis (Q1242107) (← links)
- Bimatroids and invariants (Q1254324) (← links)
- Note on a matroid with parity condition (Q1262317) (← links)
- Constructing disjoint paths on expander graphs (Q1262782) (← links)
- An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations (Q1265850) (← links)
- Approximation algorithms for minimum tree partition (Q1270776) (← links)
- Note on inverse problem with \(l_\infty\) objective function (Q1272735) (← links)
- A fast bipartite network flow algorithm for selective assembly (Q1273091) (← links)
- The life span method -- a new variant of local search (Q1275844) (← links)
- Combinatorial optimization models for production scheduling in automated manufacturing systems (Q1278813) (← links)
- A dynamic programming heuristic for the \(P\)-median problem (Q1278985) (← links)
- Fenchel-type duality for matroid valuations (Q1290625) (← links)
- Random sampling and greedy sparsification for matroid optimization problems (Q1290633) (← links)
- Discrete convex analysis (Q1290668) (← links)
- An algorithm for a concave production cost network flow problem (Q1301576) (← links)
- Constrained weighted matchings and edge coverings in graphs (Q1304484) (← links)
- A recognition problem in converting linear programming to network flow models (Q1309143) (← links)
- Clustering heuristics for set covering (Q1309879) (← links)
- Modeling uncertainty in networks (Q1310211) (← links)
- Efficient enumeration of the vertices of polyhedra associated with network LP's (Q1315430) (← links)
- Efficient labelling algorithms for the maximum noncrossing matching problem (Q1315996) (← links)
- Modeling paradigms for discrete event simulation (Q1316093) (← links)
- Tight bounds on the number of minimum-mean cycle cancellations and related results (Q1317475) (← links)
- A faster parametric minimum-cut algorithm (Q1317480) (← links)
- Algorithms and complexity analysis for some flow problems (Q1317482) (← links)
- The maximum clique problem (Q1318271) (← links)
- Optimal loop storage allocation for argument-fetching dataflow machines (Q1322508) (← links)
- Tree polytope on 2-trees (Q1322553) (← links)
- A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm (Q1323480) (← links)
- Balancing problems in acyclic networks (Q1327220) (← links)
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets (Q1330902) (← links)
- New algorithms for generalized network flows (Q1332311) (← links)
- Efficient inference in Bayes networks as a combinatorial optimization problem (Q1332727) (← links)
- A modified greedy heuristic for the set covering problem with improved worst case bound (Q1334632) (← links)
- Matroids and a forest cover problem (Q1337143) (← links)
- Maximum number of disjoint paths connecting specified terminals in a graph (Q1339394) (← links)
