The following pages link to (Q4083324):
Displayed 50 items.
- Fuzzy colouring of fuzzy graphs (Q258334) (← links)
- Generating the family of all traffic signal light cycles coordinated with pedestrian crosswalks (Q279810) (← links)
- On some factorizations of infinite words by elements of codes (Q287095) (← links)
- Problem statements for \(k\)-node shortest path and \(k\)-node shortest cycle in a complete graph (Q289795) (← links)
- Optimal design of compact and functionally contiguous conservation management areas (Q322808) (← links)
- Lyapunov formulation of the ISS cyclic-small-gain theorem for hybrid dynamical networks (Q360631) (← links)
- Decentralized output-feedback control of large-scale nonlinear systems with sensor noise (Q361022) (← links)
- Solving a bicriteria problem of optimal service centers location (Q367241) (← links)
- Choosing optimal road trajectory with random work cost in different areas (Q384698) (← links)
- The topological drawing of a graph: construction methods (Q386927) (← links)
- An SCP-based heuristic approach for scheduling distributed data-intensive applications on global grids (Q436744) (← links)
- A sector bound approach to feedback control of nonlinear systems with state quantization (Q445049) (← links)
- Lyapunov formulation of the large-scale, ISS cyclic-small-gain theorem: The discrete-time case (Q450736) (← links)
- Automation of simulation of multistep relay and switching circuits (Q499143) (← links)
- Lattice flows in networks (Q522926) (← links)
- 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)
- An integer-valued model for the problem of minimizing the total servicing time of unit claims with parallel devices with precedences (Q612218) (← links)
- Deterministic optimizational problems of transportation logistics (Q612223) (← links)
- Algorithms for solving discrete optimal control problems with infinite time horizon and determining minimal mean cost cycles in a directed graph as decision support tool (Q623763) (← links)
- Lyapunov formulation of ISS cyclic-small-gain in continuous-time dynamical networks (Q644285) (← 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)
- Inverse center location problem on a tree (Q732826) (← 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)
- Equivalent instances of the simple plant location problem (Q971550) (← links)
- Computerized generation of motion equations using variational graph-theoretic methods (Q990501) (← links)
- A constrained \(k\)-means clustering algorithm for classifying spatial units (Q998906) (← links)
- Interval-parameter optimization problems on graphs (Q1040365) (← links)
- Branch and bound algorithm for a transfer line design problem: stations with sequentially activated multi-spindle heads (Q1042027) (← 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)