The following pages link to (Q3048571):
Displaying 50 items.
- A functional equation for finding the largest expected capacity of a graph (Q3826379) (← links)
- An algorithm for the resource constrained shortest path problem (Q3827808) (← links)
- Exact cuts in networks (Q3827810) (← links)
- Simulated annealing: An introduction (Q3832323) (← links)
- Optimal enclosing regions in planar graphs (Q3832585) (← links)
- Sufficient conditions for the unique solvability of linear networks containing memoryless 2-ports (Q3866022) (← links)
- Thek best spanning arborescences of a network (Q3875356) (← links)
- An algorithm to solve them ×n assignment problem in expected timeO(mn logn) (Q3883530) (← links)
- Use of matroid theory in operations research, circuits and systems theory (Q3898311) (← links)
- A polynomially bounded algorithm for a singly constrained quadratic program (Q3899825) (← links)
- Structural questions with GERT-networks (Q3902856) (← links)
- Generalizations of Hoffman's existence theorem for circulations (Q3910279) (← links)
- A new algorithm for the assignment problem (Q3911685) (← links)
- Optimum matching forests I: Special weights (Q3922478) (← links)
- Minimum cost flow with set-constraints (Q3936464) (← links)
- Optimal sharing (Q3941156) (← links)
- A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory (Q3945965) (← links)
- Greedy Families for Linear Objective Functions (Q3970969) (← links)
- Reliability covering problems (Q3971580) (← links)
- Computing rooted communication reliability in an almost acyclic digraph (Q3978609) (← links)
- Minimum flows in (s,t) planar networks (Q3984281) (← links)
- Directed star decompositions of the complete directed graph (Q4020708) (← links)
- On general routing problems (Q4143017) (← links)
- Minimal ratio spanning trees (Q4143188) (← links)
- Alternating Basis Exchanges in Matroids (Q4182767) (← links)
- Optimal project compression with due-dated events (Q4186072) (← links)
- Optimally fast shortest path algorithms for some classes of graphs (Q4236113) (← links)
- Understanding retiming through maximum average-delay cycles (Q4277377) (← links)
- Algorithms for single-machine scheduling with stochastic outtree precedence relations to minimize expected weighted flow time or maximum expected lateness (Q4300605) (← links)
- Independent edges in bipartite graphs obtained from orientations of graphs (Q4304256) (← links)
- Computation of the forwarding index via flows: A note (Q4305121) (← links)
- Maximum likelihood genetic sequence reconstruction from oligo content (Q4305126) (← links)
- Graphs with the Circuit Cover Property (Q4305925) (← links)
- Revised Greedy algorithm for formation of a minimal cycle basis of a graph (Q4306913) (← links)
- ON INFORMATION-PRESERVING TRANSFORMATIONS (Q4367952) (← links)
- On the difficulty of finding walks of length k (Q4385673) (← links)
- Algorithms for source-to-all maximum cost-to-time ratio problem in acyclic networks (Q4422619) (← links)
- Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem (Q4432762) (← links)
- Scheduling jobs with piecewise linear decreasing processing times (Q4456082) (← links)
- On Eigenproblem for Circulant Matrices in Max-Algebra (Q4531546) (← links)
- Computing Weighted Strength and Applications to Partitioning (Q4558887) (← links)
- A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs (Q4623143) (← links)
- Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Corrected Version) (Q4641588) (← links)
- Approximation algorithms for finding low-degree subgraphs (Q4651931) (← links)
- Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries (Q4700651) (← links)
- Bimatroidal independence systems (Q4729800) (← links)
- Probabilistic analysis of an lp relaxation bound for the steiner problem in networks (Q4732318) (← links)
- Integral decomposition in polyhedra (Q4740329) (← links)
- An Algorithm for Partitioning the Nodes of a Graph (Q4740598) (← links)
- Parametric approaches to fractional programs (Q4744080) (← links)
