The following pages link to (Q4083324):
Displayed 50 items.
- Fuzzy quadratic minimum spanning tree problem (Q556109) (← links)
- Maximum outflow in generalized flow networks (Q583080) (← links)
- Traffic assignment in communication satellites (Q594769) (← links)
- Distance conserving reductions for nonoriented networks (Q594774) (← links)
- On paths with the shortest average arc length in weighted graphs (Q686427) (← links)
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
- Structurally fixed modes: Decomposition and reachability (Q752641) (← links)
- Transmission facility planning in telecommunications networks: A heuristic approach (Q788618) (← links)
- A successful algorithm for solving directed Hamiltonian path problems (Q788642) (← links)
- Network models for vehicle and crew scheduling (Q792872) (← links)
- The absolute centre of a graph (Q793644) (← links)
- The multi-facility min-max Weber problem (Q795710) (← links)
- Shortest paths in networks with vector weights (Q795755) (← links)
- Efficient spanning trees (Q796551) (← links)
- Filtrations of the modules for Chevalley groups arising from admissible lattices (Q810639) (← links)
- The k-neighbor domination problem (Q811346) (← links)
- An optimization algorithm for the clearing of interbank payments (Q819066) (← links)
- The \(p\)-median problem: a survey of metaheuristic approaches (Q864013) (← links)
- Synthesis of optimal controllers for piecewise affine systems with sampled-data switching (Q875964) (← links)
- The discrete p-dispersion problem (Q915643) (← links)
- A constrained \(k\)-means clustering algorithm for classifying spatial units (Q998906) (← links)
- A computational procedure for the asymptotic analysis of homogeneous semi-Markov processes (Q1060493) (← links)
- A successful algorithm for the undirected Hamiltonian path problem (Q1061488) (← links)
- On the chromatic number of certain highly symmetric graphs (Q1062067) (← links)
- Location problems (Q1062596) (← links)
- Equivalence between the minimum covering problem and the maximum matching problem (Q1068107) (← links)
- Numerical experiences with graph coloring algorithms (Q1070239) (← links)
- DB2 and DB2A: Two useful tools for constructing Hamiltonian circuits (Q1092923) (← links)
- A fault diagnosis in a nonlinear location network (Q1095785) (← links)
- A graph coloring algorithm for large scale scheduling problems (Q1096533) (← links)
- Binomial-combinatorial properties of Clar structures (Q1096641) (← links)
- A heuristic for the p-center problem in graphs (Q1098862) (← links)
- Fast parallel graph searching with applications (Q1103409) (← links)
- Graph theoretic foundations of pathfinder networks (Q1104895) (← links)
- Reachability matrix by partitioning and related Boolean results (Q1118616) (← links)
- An approximation algorithm for the TSP (Q1119485) (← links)
- Easy and hard bottleneck location problems (Q1135201) (← links)
- State structures in digital filter configurations. II: Reduced and minimal state structures (Q1135274) (← links)
- An algorithm for the min concave cost flow problem (Q1142707) (← links)
- Proving phylogenetic trees minimal with l-clustering and set partitioning (Q1144514) (← links)
- An O(m log D) algorithm for shortest paths (Q1145158) (← links)
- Complexity of spanning tree problems: Part I (Q1145635) (← links)
- A graph theoretical bound for the p-median problem (Q1148208) (← links)
- Reducibility of minimax to minisum 0-1 programming problems (Q1148229) (← links)
- Irregular gaming areas (Q1150531) (← links)
- Heuristics and their design: A survey (Q1152854) (← links)
- Stochastic spanning tree problem (Q1155516) (← links)
- An approach to the problems of routing optimization in the regions of intricate shape (Q1157911) (← links)
- Optimal assignment of broadcasting frequencies (Q1159572) (← links)
- Algorithms for the m-center problems: A survey (Q1162436) (← links)