The following pages link to (Q3751390):
Displaying 50 items.
- Near optimal design of wavelength routed optical networks (Q322603) (← links)
- A branch-and-price approach for harvest scheduling subject to maximum area restrictions (Q434163) (← links)
- Interval propagation to reason about sets: Definition and implementation of a practical language (Q679421) (← links)
- Sufficient conditions for the convergence of a class of nonlinear distributed consensus algorithms (Q716153) (← links)
- A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations (Q845585) (← links)
- A bulk-synchronous parallel process algebra (Q875955) (← links)
- Minimax regret spanning arborescences under uncertain costs (Q881514) (← links)
- Network-based reconfiguration routes for a self-reconfigurable robot (Q954471) (← links)
- Periodic schedules for linear precedence constraints (Q1003670) (← links)
- Quantitative analysis of continuous weighted marked graphs (Q1026375) (← links)
- On some topological properties of a strongly connected compartmental system with application to the identifiability problem (Q1094365) (← links)
- Graph nodes and a definition of structural similarity (Q1103651) (← links)
- Performance modeling and optimization of networks of bridged LANs (Q1176441) (← links)
- Trends in systolic and cellular computation (Q1184130) (← links)
- A combinatorial interior point method for network flow problems (Q1196185) (← links)
- Optimal design of LAN-WAN internetworks: An approach using simulated annealing (Q1197793) (← links)
- On pseudounimodular matrices (Q1209155) (← links)
- Classical and new heuristics for the open-shop problem: A computational evaluation (Q1296088) (← links)
- A new saling algorithm for the maximum mean cut problem (Q1317477) (← links)
- Dependency structure analysis as combinatorial optimization (Q1328543) (← links)
- New algorithms for generalized network flows (Q1332311) (← links)
- Periodicity and critical circuits in a generalized max-algebra setting (Q1332447) (← links)
- Flatwords and Post Correspondence Problem (Q1351939) (← links)
- Powers of matrices over an extremal algebra with applications to periodic graphs (Q1366320) (← links)
- The minimum cost shortest-path tree game (Q1761744) (← links)
- A SAT approach to query optimization in mediator systems (Q1777403) (← links)
- Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling (Q1801806) (← links)
- On the intersection of two particular convex sets (Q1918016) (← links)
- Isodistant points in competitive network facility location (Q1939096) (← links)
- Filter-embedding semiring fusion for programming with MapReduce (Q1941877) (← links)
- Minimum spanning table and optimal expansion of competence set (Q1969528) (← links)
- Emerging spanning trees in the work of Candilis-Josic-Woods (Q2091611) (← links)
- Algorithms for approximate subtropical matrix factorization (Q2218339) (← links)
- Semi-classical limit and least action principle revisited with \((\min,+)\) path integral and action-particle duality (Q2307873) (← links)
- Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem (Q2453730) (← links)
- Maximum network flows with concave gains (Q2492702) (← links)
- Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine (Q2669805) (← links)
- Local and global robustness with \(q\)-step delay for max-plus linear systems (Q2673760) (← links)
- An Optimal Constraint Programming Approach to the Open-Shop Problem (Q2815442) (← links)
- A Note on the Existence of All (g,f)-Factors (Q2985119) (← links)
- WELL-CONSTRAINED COMPLETION AND DECOMPOSITION FOR UNDER-CONSTRAINED GEOMETRIC CONSTRAINT PROBLEMS (Q3422216) (← links)
- EFFICIENT ALGORITHMS FOR THE OPTIMAL-RATIO REGION DETECTION PROBLEMS IN DISCRETE GEOMETRY WITH APPLICATIONS (Q3636313) (← links)
- Algebraic Methods Applied to Network Reliability Problems (Q3758857) (← links)
- Models for machine-part grouping in cellular manufacturing (Q4230175) (← links)
- Constraint propagation for ordering, abstraction, and aggregation relations (Q4420773) (← links)
- Efficient algorithms for solving systems of linear equations and path problems (Q5096775) (← links)
- State‐Feedback Control for a Class of Timed Petri Nets Subject to Marking Constraints (Q5194910) (← links)
- Inverse source problem in a forced network (Q5383307) (← links)
- An efficient parallel algorithm for shortest paths in planar layered digraphs (Q5490027) (← links)
- ANALYZING VULNERABILITIES OF CRITICAL INFRASTRUCTURES USING FLOWS AND CRITICAL VERTICES IN AND/OR GRAPHS (Q5696968) (← links)
