The following pages link to (Q5583694):
Displayed 39 items.
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
- Survey of polynomial transformations between NP-complete problems (Q555184) (← links)
- A survey of dynamic network flows (Q917417) (← links)
- Periodic schedules for linear precedence constraints (Q1003670) (← links)
- The cost-to-time ratio problem for large or infinite graphs (Q1101357) (← links)
- Minimum cost-reliability ratio path problem (Q1102209) (← links)
- On the dependence of the maximum cycle mean of a matrix on permutations of the rows and columns (Q1124653) (← links)
- Fractional programming: Applications and algorithms (Q1148821) (← links)
- Weighted min cost flows (Q1168883) (← links)
- A fully polynomial time approximation scheme for minimum cost-reliability ratio problems (Q1183334) (← links)
- An \(O(n^ 2)\) algorithm for the maximum cycle mean of an \(n\times n\) bivalent matrix (Q1183336) (← links)
- A pseudo-polynomial algorithm for detecting minimum weighted length paths in a network (Q1197968) (← links)
- Algorithms for the minimum cost circulation problem based on maximizing the mean improvement (Q1200795) (← links)
- A characterization of the minimum cycle mean in a digraph (Q1249587) (← links)
- Balancing problems in acyclic networks (Q1327220) (← links)
- Computing maximum mean cuts (Q1329796) (← links)
- The most critical path in a PERT network: A heuristic approach (Q1341990) (← links)
- Paths with minimum range and ratio of arc lengths (Q1377658) (← links)
- Numerical analysis of generalised max-plus eigenvalue problems. (Q1427218) (← links)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- An \(O(n^{2}\)) algorithm for maximum cycle mean of Monge matrices in max-algebra. (Q1811083) (← links)
- Extremal eigenproblem for bivalent matrices (Q1894469) (← links)
- The basic cyclic scheduling problem with linear precedence constraints (Q1917250) (← links)
- The maximum ratio clique problem (Q2356159) (← links)
- A network-based model for transporting extremely hazardous materials (Q2367398) (← links)
- Dioïds and semirings: Links to fuzzy sets and other applications (Q2372262) (← links)
- Vyacheslav Tanaev: contributions to scheduling and related areas (Q2434293) (← links)
- Detecting highly oscillatory signals by chirplet path pursuit (Q2470541) (← links)
- Status of periodic optimization of dynamical systems (Q2561769) (← links)
- \(\ell\)-parametric eigenproblem in max-algebra (Q2565847) (← links)
- Approximating a class of combinatorial problems with rational objective function (Q2638374) (← links)
- Dynamic analysis of repetitive decision-free discrete-event processes: The algebra of timed marked graphs and algorithmic issues (Q2639765) (← links)
- Computing optimal scalings by parametric network algorithms (Q3691441) (← links)
- A note on weighted minimal cost flows (Q3895198) (← links)
- Bibliography in fractional programming (Q3958287) (← links)
- Fractional programming (Q5896201) (← links)
- Facets of the \(p\)-cycle polytope (Q5946821) (← links)
- A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems (Q6068539) (← links)
- The multi-weighted spanning tree problem (Q6085702) (← links)