The following pages link to (Q4130999):
Displaying 50 items.
- The shortest path problem with forbidden paths (Q146692) (← links)
- Multistable selection equations of pattern formation type in the case of inhomogeneous growth rates: With applications to two-dimensional assignment problems (Q432929) (← links)
- The traveling salesman problem with flexible coloring (Q444446) (← links)
- On the structure of the \(h\)-vector of a paving matroid (Q449206) (← links)
- On finding optimal polytrees (Q500966) (← links)
- Approximating \(k\)-spanner problems for \(k>2\) (Q557826) (← links)
- Ordered vertex removal and subgraph problems (Q582090) (← links)
- Traffic assignment in communication satellites (Q594769) (← links)
- Shortest path and maximum flow problems in networks with additive losses and gains (Q620954) (← links)
- Relay placement for fault tolerance in wireless networks in higher dimensions (Q632722) (← links)
- The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate (Q672389) (← links)
- A cost-scaling algorithm for \(0-1\) submodular flows (Q678855) (← links)
- Poset matching---a distributive analog of independent matching (Q685701) (← links)
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
- The generic canonical form of a regular structured matrix pencil (Q697066) (← links)
- A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses (Q699349) (← links)
- A combinatoric interpretation of dual variables for weighted matching and \(f\)-factors (Q714819) (← links)
- Heuristically guided algorithm for k-parity matroid problems (Q754224) (← links)
- An algorithm for ranking paths that may contain cycles (Q759658) (← links)
- On dual solutions of the linear assignment problem (Q761971) (← links)
- Network production-location problems under price uncertainty (Q788616) (← links)
- Transmission facility planning in telecommunications networks: A heuristic approach (Q788618) (← links)
- A parametric algorithm for convex cost network flow and related problems (Q789313) (← links)
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem (Q790044) (← links)
- On a multicriteria shortest path problem (Q790051) (← links)
- On finding the K best cuts in a network (Q792224) (← links)
- Optimal matchings in posets (Q792355) (← links)
- A multi-level bottleneck assignment approach to the bus drivers' rostering problem (Q792882) (← links)
- On a special class of bicriterion path problems (Q793640) (← links)
- Matroid optimization with the interleaving of two ordered sets (Q793743) (← links)
- A simple version of Karzanov's blocking flow algorithm (Q795064) (← links)
- The matroidal knapsack: A class of (often) well-solvable problems (Q797497) (← links)
- On the regularity of matrices in min algebra (Q807718) (← links)
- A linear time algorithm for the maximum capacity path problem (Q809905) (← links)
- A hybrid genetic algorithm for the three-index assignment problem (Q818096) (← links)
- Necessary and sufficient conditions of optimality for some classical scheduling problems (Q852941) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- Incremental assignment problem (Q865928) (← links)
- Boundary labeling: Models and efficient algorithms for rectangular maps (Q868108) (← links)
- A survey of results for sequencing problems with controllable processing times (Q908846) (← links)
- Decomposing a relation into a tree of binary relations (Q909447) (← links)
- k-sum optimization problems (Q916568) (← links)
- On the continuous working problem (Q917431) (← links)
- Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks (Q932187) (← links)
- A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem (Q932651) (← links)
- On complexity of special maximum matchings constructing (Q952636) (← links)
- On the approximability of minmax (regret) network optimization problems (Q976089) (← links)
- Network flow interdiction on planar graphs (Q987697) (← links)
- Capacitated procurement planning with price-sensitive demand and general concave-revenue functions (Q1002053) (← links)
- Worst case analysis of a greedy algorithm for graph thickness (Q1007554) (← links)
