The following pages link to (Q3048571):
Displaying 50 items.
- Monotone labelings in polygonal tilings (Q1356633) (← links)
- An analytic symmetrization of max flow-min cut (Q1356775) (← links)
- Multicommodity network flow with jump constraints (Q1356790) (← links)
- Max-min matching problems with multiple assignments (Q1359459) (← links)
- Inverse matroid intersection problem (Q1362679) (← links)
- Massively parallel augmenting path algorithms for the assignment problem (Q1365535) (← links)
- Approximate algorithms for the \(P\parallel C_{\max}\) problem (Q1367883) (← links)
- Flows on hypergraphs (Q1373748) (← links)
- A maximum \(b\)-matching problem arising from median location models with applications to the roommates problem (Q1380926) (← links)
- Two-path subsets: Efficient counting and applications to performability analysis (Q1392544) (← links)
- New bounds for optimum traffic assignment in satellite communication. (Q1406681) (← links)
- Optimal path planning based on visibility (Q1411497) (← links)
- Generalized path-finding algorithms on semirings and the fuzzy shortest path problem. (Q1421231) (← links)
- Inverse problems of submodular functions on digraphs (Q1573989) (← links)
- Degenerate optimal basis graphs in linear programming (Q1576320) (← links)
- Machine scheduling with a rate-modifying activity (Q1592740) (← links)
- The symmetry number problem for trees (Q1603439) (← links)
- Computing Euclidean bottleneck matchings in higher dimensions (Q1607062) (← links)
- A framework for the greedy algorithm (Q1613405) (← links)
- A variable neighborhood search heuristic for the maximum ratio clique problem (Q1652431) (← links)
- Rough sets and matroids from a lattice-theoretic viewpoint (Q1671721) (← links)
- Revisiting \(k\)-sum optimization (Q1675256) (← links)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- Gross substitutability: an algorithmic survey (Q1682734) (← links)
- A type of biased consensus-based distributed neural network for path planning (Q1683882) (← links)
- Minimum-cost flows in unit-capacity networks (Q1693987) (← links)
- Fast approximation of matroid packing and covering (Q1730564) (← links)
- Traffic equilibrium with a continuously distributed bound on travel weights: the rise of range anxiety and mental account (Q1730667) (← links)
- Parameterized complexity of the spanning tree congestion problem (Q1759686) (← links)
- A hybrid framework for over-constrained generalized resource-constrained project scheduling problems (Q1768898) (← links)
- Improved approximation algorithms for capacitated facility location problems (Q1771310) (← links)
- A novel chaotic particle swarm optimization algorithm for parking space guidance (Q1793252) (← links)
- Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem (Q1800990) (← links)
- The minimum spanning tree problem on a planar graph (Q1805468) (← links)
- Using the generalized assignment problem in scheduling the ROSAT space telescope (Q1806665) (← links)
- Multiple bottleneck assignment problem (Q1806893) (← links)
- The multi-mode resource-constrained project scheduling problem with generalized precedence relations (Q1807061) (← links)
- Notes on polyhedra associated with hop-constrained paths (Q1807932) (← links)
- On patching algorithms for random asymmetric travelling salesman problems (Q1813831) (← links)
- Solving the linear matroid parity problem as a sequence of matroid intersection problems (Q1813836) (← links)
- A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem (Q1814992) (← links)
- Triangulations intersect nicely (Q1816461) (← links)
- A multiparameter analysis of the boundedness problem for vector addition systems (Q1819938) (← links)
- A bidirectional shortest-path algorithm with good average-case behavior (Q1823692) (← links)
- Multi-constrained matroidal knapsack problems (Q1824560) (← links)
- Solving combinatorial problems with combined min-max-min-sum objective and applications (Q1824562) (← links)
- New lower bounds for the symmetric travelling salesman problem (Q1824572) (← links)
- Connectivity and edge-disjoint spanning trees (Q1837196) (← links)
- Algorithm for the solution of the assignment problem for sparse matrices (Q1838425) (← links)
- The real truth about star designs (Q1876685) (← links)
