The following pages link to (Q5595961):
Displaying 50 items.
- Tight bounds for periodicity theorems on the unbounded knapsack problem (Q421659) (← links)
- Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs (Q444440) (← links)
- Restricted vertex multicut on permutation graphs (Q444445) (← links)
- An application of Gomory cuts in number theory (Q580401) (← links)
- A measure-theoretical max-flow-min-cut problem (Q583082) (← links)
- A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix (Q677132) (← links)
- The decomposition of a communication network considering traffic demand interrelations (Q679227) (← links)
- Primal-dual approximation algorithms for integral flow and multicut in trees (Q679443) (← links)
- Graph connectivity and its augmentation: Applications of MA orderings (Q697579) (← links)
- Multicommodity flows in tree-like networks (Q733946) (← links)
- Problems of efficient application and development of a network under capital investments and credits (Q740558) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- A parametric algorithm for convex cost network flow and related problems (Q789313) (← links)
- Shortest paths in networks with vector weights (Q795755) (← links)
- A maximum flow problem with intermediate node requirements (Q801796) (← links)
- An exact algorithm for large unbounded knapsack problems (Q913659) (← links)
- On maximum flows in polyhedral domains (Q918212) (← links)
- Maximum flows and minimum cuts in the plane (Q989897) (← links)
- On a simple deadlock recovery problem (Q1051555) (← links)
- The inclusion problem for some classes of deterministic multitape automata (Q1056540) (← links)
- Analysis of algorithms on problems in general abelian groups (Q1062753) (← links)
- Fair relation and modified synchronic distances in a Petri net (Q1067788) (← links)
- An algorithm for the periodic solutions in the knapsack problem (Q1075253) (← links)
- Combinatorial approaches to multiflow problems (Q1080357) (← links)
- On equivalent knapsack problems (Q1082265) (← links)
- A decomposition algorithm for multi-terminal network flows (Q1085042) (← links)
- Edge-connectivity augmentation problems (Q1091147) (← links)
- Approximation algorithms for weighted matching (Q1102118) (← links)
- On the computational complexity of the Abelian permutation group structure, membership and intersection problems (Q1106934) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- The planar multiterminal cut problem (Q1130183) (← links)
- The subgraph homeomorphism problem (Q1137871) (← links)
- On inclusion problem for deterministic multitape automata (Q1146516) (← links)
- Integer programming by long division (Q1148230) (← links)
- Number of natural solutions of a system of linear Diophantine equations (Q1149471) (← links)
- Optimal planning of network structures within an exchange area (Q1150523) (← links)
- Further results on the spectral decomposition of an incidence matrix (Q1176306) (← links)
- Ancestor tree for arbitrary multi-terminal cut functions (Q1179737) (← links)
- Fine covers of a VAS language (Q1186433) (← links)
- Aggregation of equations in integer programming (Q1214343) (← links)
- Accelerating Greenberg's method for the computation of knapsack functions (Q1217017) (← links)
- A note on transition systems (Q1230656) (← links)
- Matrix operations and the properties of networks and directed graphs (Q1235717) (← links)
- Complexity of some problems in Petri nets (Q1238999) (← links)
- Static main storage packing problems (Q1241277) (← links)
- Discrete right hand side parametrization for linear integer programs (Q1249136) (← links)
- An extension of Hu's group minimization algorithm (Q1254946) (← links)
- On max-flow min-cut and integral flow properties for multicommodity flows in directed networks (Q1262198) (← links)
- A relation between the knapsack and group knapsack problems (Q1270786) (← links)
- A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis (Q1276973) (← links)
