The following pages link to (Q3048571):
Displaying 50 items.
- On multicommodity flows in planar graphs (Q3340473) (← links)
- Network reliability and acyclic orientations (Q3342378) (← links)
- Unlabelled Partition Systems: Optimization and Complexity (Q3344219) (← links)
- Using structured steiner trees for hierarchical global routing (Q3348418) (← links)
- Information tradeoffs in model building: A network routing application (Q3354612) (← links)
- Optimal routing and process scheduling for a mobile service facility (Q3356097) (← links)
- Some aspects on solving transportation problem (Q3388797) (← links)
- A Bayesian Approach to Simulated Annealing (Q3415945) (← links)
- MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES (Q3421855) (← links)
- An Extension of the Brouwer-Zimmermann Minimum Weight Algorithm (Q3460472) (← links)
- k-Best constrained bases of a matroid (Q3470256) (← links)
- Invited paper Data rate optimization in synchronous circuits (Q3479985) (← links)
- A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM (Q3502867) (← links)
- The Complexity of Bottleneck Labeled Graph Problems (Q3508579) (← links)
- ASSIGNMENT QUERY AND ITS IMPLEMENTATION IN MOVING OBJECT DATABASES (Q3565423) (← links)
- Tropical Arithmetic and Matrix Algebra (Q3627042) (← links)
- Maximum-throughput dynamic network flows (Q3664790) (← links)
- Distributed asynchronous computation of fixed points (Q3671771) (← links)
- The traveling salesman problem: An update of research (Q3671783) (← links)
- A unified framework for primal-dual methods in minimum cost network flow problems (Q3683845) (← links)
- Calculating bounds on reachability and connectedness in stochastic networks (Q3686053) (← links)
- A decomposition algorithm for linear relaxation of the weightedr-covering problem (Q3688125) (← links)
- Dealing with degeneracy in reduced gradient algorithms (Q3691433) (← links)
- Computing optimal scalings by parametric network algorithms (Q3691441) (← links)
- Roof duality, complementation and persistency in quadratic 0–1 optimization (Q3693267) (← links)
- Eulerian Orientations and Circulations (Q3697049) (← links)
- A time expanded matroid algorithm for finding optimal dynamic matroid intersections (Q3698812) (← links)
- Efficient dual simplex algorithms for the assignment problem (Q3701192) (← links)
- Steiner trees, connected domination and strongly chordal graphs (Q3701460) (← links)
- A minimum concave-cost dynamic network flow problem with an application to lot-sizing (Q3703618) (← links)
- Solving matching problems with linear programming (Q3703653) (← links)
- Shortest‐path methods: Complexity, interrelations and new propositions (Q3706872) (← links)
- Synthesis of directed multicommodity flow networks (Q3712097) (← links)
- Scaling: A general framework (Q3730337) (← links)
- A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm (Q3731344) (← links)
- Strict matching matroids and matroid algorithms (Q3744174) (← links)
- The Null Space Problem I. Complexity (Q3747622) (← links)
- Polyhedral Combinatorics in Combinatorial Optimization (Q3763906) (← links)
- A particular timetable problem: terminal scheduling (Q3766555) (← links)
- Counting almost minimum cutsets with reliability applications (Q3768663) (← links)
- Hamiltonian circuits with generalised cost (Q3770277) (← links)
- Two algorithms for weighted matroid intersection (Q3770280) (← links)
- Computing a Sparse Basis for the Null Space (Q3774827) (← links)
- LP extreme points and cuts for the fixed-charge network design problem (Q3778564) (← links)
- Topological conditions for the unique solvability of linear time-invariant and time-varying networks (Q3778680) (← links)
- Algorithms for maximumk-colorings andk-coverings of transitive graphs (Q3783310) (← links)
- The Null Space Problem II. Algorithms (Q3783422) (← links)
- Improving reliability bounds in computer networks (Q3787776) (← links)
- Minimum-cost mixtures of area and point defenses assuming simultaneous attack (Q3790935) (← links)
- Polymatroidal flow network models with multiple sinks (Q3796942) (← links)
