Pages that link to "Item:Q1843373"

The following pages link to Network flow, transportation and scheduling. Theory and algorithms (Q1843373):

Displaying 34 items.

• Hierarchical decomposition of symmetric discrete systems by matroid and group theories (Q687038) (← links)
• On dual solutions of the linear assignment problem (Q761971) (← links)
• A network flow procedure for project crashing with penalty nodes (Q790038) (← links)
• Minimal currents and relaxation of variational integrals on mappings of bounded variation (Q919255) (← links)
• New algorithms for convex cost tension problem with application to computer vision (Q1040084) (← links)
• Detection of structural inconsistency in systems of equations with degrees of freedom and its applications (Q1062429) (← links)
• A very personal reminiscence on the problem of computational complexity (Q1091818) (← links)
• Homotopy base of acyclic graphs - a combinatorial analysis of commutative diagrams by means of preordered matroid (Q1097893) (← links)
• Menger-decomposition of a graph and its application to the structural analysis of a large-scale system of equations (Q1100219) (← links)
• An efficient PQ-graph algorithm for solving the graph-realization problem (Q1142044) (← links)
• An algorithm for solving quadratic network flow problems (Q1175149) (← links)
• Minimal currents, geodesics, and relaxation of variational integrals on mappings of bounded variation (Q1196419) (← links)
• Examples of max-flow and min-cut problems with duality gaps in continuous networks (Q1322557) (← links)
• Optimal distributed execution of join queries (Q1328829) (← links)
• Incorporating processor costs in optimizing the distributed execution of join queries (Q1336868) (← links)
• Minimizing the response time of executing a join between fragmented relations in a distributed database system (Q1362219) (← links)
• A greedy algorithm for the optimal basis problem (Q1371665) (← links)
• Theory of uncontrollable flows -- a new type of network-flow theory as a model for the 21st century of multiple values (Q1608406) (← links)
• Conjugacy relationship between M-convex and L-convex functions in continuous variables (Q1764239) (← links)
• Extension of M-convexity and L-convexity to polyhedral convex functions (Q1841175) (← links)
• Genetic algorithms in constrained optimization (Q1921070) (← links)
• Half-integrality of node-capacitated multiflows and tree-shaped facility locations on trees (Q1942273) (← links)
• On the motion of substance in a channel and growth of random networks (Q2078640) (← links)
• Substitutes and complements in network flows viewed as discrete convexity (Q2581320) (← links)
• A boolean theory of network flows and metrics and its applications to particle transmission and clustering (Q3204981) (← links)
• A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm (Q3731344) (← links)
• Simultaneous computation of functions, partial derivatives and estimates of rounding errors —Complexity and practicality— (Q3773162) (← links)
• Duality relationships between a class of graphs and linear programs (Q3907431) (← links)
• Unique solvability and order of complexity of linear networks containing memorylessn-ports (Q4178929) (← links)
• Power packet transferability via symbol propagation matrix (Q4557679) (← links)
• Computer-Aided Creation of Impossible Objects and Impossible Motions (Q5302755) (← links)
• “Rent-or-Buy” Scheduling and Cost Coloring Problems (Q5458824) (← links)
• Some problems in discrete optimization (Q5636690) (← links)
• On some techniques useful for solution of transportation network problems (Q5668591) (← links)