scientific article; zbMATH DE number 3302125
From MaRDI portal
Publication:5583694
Cited in
(41)- Periodic schedules for linear precedence constraints
- The cost-to-time ratio problem for large or infinite graphs
- Minimum cost-reliability ratio path problem
- On the dependence of the maximum cycle mean of a matrix on permutations of the rows and columns
- Fractional programming: Applications and algorithms
- Weighted min cost flows
- A fully polynomial time approximation scheme for minimum cost-reliability ratio problems
- An O(n^ 2) algorithm for the maximum cycle mean of an n n bivalent matrix
- A pseudo-polynomial algorithm for detecting minimum weighted length paths in a network
- Algorithms for the minimum cost circulation problem based on maximizing the mean improvement
- A characterization of the minimum cycle mean in a digraph
- Balancing problems in acyclic networks
- Computing maximum mean cuts
- The most critical path in a PERT network: A heuristic approach
- Paths with minimum range and ratio of arc lengths
- Numerical analysis of generalised max-plus eigenvalue problems.
- Fractional 0-1 programming: applications and algorithms
- An \(O(n^{2}\)) algorithm for maximum cycle mean of Monge matrices in max-algebra.
- Extremal eigenproblem for bivalent matrices
- The basic cyclic scheduling problem with linear precedence constraints
- The maximum ratio clique problem
- A network-based model for transporting extremely hazardous materials
- Dioïds and semirings: Links to fuzzy sets and other applications
- Vyacheslav Tanaev: contributions to scheduling and related areas
- Detecting highly oscillatory signals by chirplet path pursuit
- Status of periodic optimization of dynamical systems
- \(\ell\)-parametric eigenproblem in max-algebra
- Approximating a class of combinatorial problems with rational objective function
- Dynamic analysis of repetitive decision-free discrete-event processes: The algebra of timed marked graphs and algorithmic issues
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- Computing optimal scalings by parametric network algorithms
- A note on weighted minimal cost flows
- Bibliography in fractional programming
- Survey of polynomial transformations between NP-complete problems
- Fractional programming
- Facets of the p-cycle polytope
- A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems
- The multi-weighted spanning tree problem
- How to do a half-turn in the cyclic tower of Hanoi
- A note on the core of 2-matching games
- A survey of dynamic network flows
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5583694)
