The following pages link to V.Peteanu (Q593488):
Displaying 31 items.
- Generating improved dominance conditions for the flowshop problem (Q580164) (← links)
- Scheduling ordered open shops (Q580167) (← links)
- Multiperiod capacity expansion of road networks: Formulation and algorithms (Q690189) (← links)
- A polynomial algorithm for minimum quadratic cost flow problems (Q761341) (← links)
- The weighted linear optimal distribution problem and applications (Q805491) (← links)
- \(k\)-linked and \(k\)-cyclic digraphs (Q917574) (← links)
- Network flows with age dependent decay rates (Q1060129) (← links)
- On the cone of nonnegative circuits (Q1080435) (← links)
- Generating and counting valid patterns in routes between two points (Q1080436) (← links)
- The equal flow problem (Q1108179) (← links)
- Processes with alternating activities (Q1108186) (← links)
- Optimal resolution sequence of problems modelled by directed graphs (Q1112059) (← links)
- Short cycles in digraphs (Q1112060) (← links)
- An application of submodular flows (Q1119596) (← links)
- Polyhedra related to undirected multicommodity flows (Q1119951) (← links)
- A dual algorithm for submodular flow problems (Q1183393) (← links)
- Efficient implementation of heuristics for the continuous network design problem (Q1184530) (← links)
- On the computational behavior of a polynomial-time network flow algorithm (Q1190598) (← links)
- On the integral plane two-commodity flow problem (Q1197891) (← links)
- Logistics systems analysis (Q1202125) (← links)
- The cycling of partitions and composition under repeated shifts (Q1271859) (← links)
- On the complexity of the dual method for maximum balanced flows (Q1324690) (← links)
- Duality theorems for a continuous analog of Ford-Fulkerson flows in networks (Q1325747) (← links)
- Multicover Ucycles (Q1343787) (← links)
- A continuous analog of Ford-Fulkerson flows in networks and its application to a problem of Rota (Q1814142) (← links)
- Integer optimization on convex semialgebraic sets (Q1971505) (← links)
- On a resource allocation problem on transport networks with two uncertainty factors (Q2366329) (← links)
- A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks (Q2366611) (← links)
- (Q3220373) (← links)
- (Q3321860) (← links)
- (Q3337392) (← links)
