scientific article

Ravindra K. Ahuja, James B. Orlin, Thomas L. Magnanti

Publication date: 23 November 2010

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (only showing first 100 items - show all)

Fuzzy multi-level minimum cost flow problems ⋮ The suffix tree of a tree and minimizing sequential transducers ⋮ A polynomial-time algorithm for message routing in hierarchical communication networks ⋮ Source sink flows with capacity installation in batches ⋮ Color constrained combinatorial optimization problems ⋮ On the computational behavior of a polynomial-time network flow algorithm ⋮ New scaling algorithms for the assignment and minimum mean cycle problems ⋮ The point-to-point delivery and connection problems: Complexity and algorithms ⋮ Heuristics for capacity planning problems with congestion ⋮ A two-phase algorithm for the biobjective integer minimum cost flow problem ⋮ A strongly polynomial simplex method for the linear fractional assignment problem ⋮ A faster polynomial algorithm for the unbalanced Hitchcock transportation problem ⋮ Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width ⋮ Generic iterative subset algorithms for discrete tomography ⋮ Minimization of circuit registers: Retiming revisited ⋮ Discrete mathematical models in the analysis of splitting iterative methods for linear systems ⋮ Executability of scenarios in Petri nets ⋮ Minimal sensor integrity: Measuring the vulnerability of sensor grids ⋮ An addendum on the incremental assignment problem ⋮ Finding non-dominated solutions in bi-objective integer network flow problems ⋮ The equitable dispersion problem ⋮ Network flow formulation of optimal perimeter sensory coverage problem ⋮ A multi-unit tender award process: The case of Transantiago ⋮ Cycle-based facets of chromatic scheduling polytopes ⋮ Integral cycle bases for cyclic timetabling ⋮ Detecting critical nodes in sparse graphs ⋮ A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem ⋮ The \(k\)-assignment polytope ⋮ Uncapacitated lot sizing with backlogging: the convex hull ⋮ Multiline addressing by network flow ⋮ Modeling supplier selection and the use of option contracts for global supply chain design ⋮ Customer segmentation, allocation planning and order promising in make-to-stock production ⋮ Finding integer efficient solutions for bicriteria and tricriteria network flow problems using DINAS ⋮ Approximate labelled subtree homeomorphism ⋮ A heuristic for blocking flow algorithms ⋮ Computing and minimizing the relative regret in combinatorial optimization with interval data ⋮ An implementation of linear and nonlinear multicommodity network flows ⋮ GRAFT, a complete system for data fusion ⋮ Optimizing phylogenetic diversity across two trees ⋮ A parametric critical path problem and an application for cyclic scheduling ⋮ Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs ⋮ Two-mode multi-partitioning ⋮ The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable ⋮ Approximability of minimum AND-circuits ⋮ A fast bipartite network flow algorithm for selective assembly ⋮ VNS and second order heuristics for the min-degree constrained minimum spanning tree problem ⋮ Lower and upper bounds for a capacitated plant location problem with multicommodity flow ⋮ Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms ⋮ On column generation formulations for the RWA problem ⋮ Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems ⋮ On optimization, dynamics and uncertainty: A tutorial for gene-environment networks ⋮ A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges ⋮ A fuzzy shortest path with the highest reliability ⋮ Aggregation error for location models: Survey and analysis ⋮ The tricriterion shortest path problem with at least two bottleneck objective functions ⋮ Optimization of a peer-to-peer system for efficient content replication ⋮ An extension of labeling techniques for finding shortest path trees ⋮ Optimality conditions in preference-based spanning tree problems ⋮ Combinatorial optimization in system configuration design ⋮ Minimum-weight cycle covers and their approximability ⋮ The minimum spanning tree problem with fuzzy costs ⋮ Characterizing multiterminal flow networks and computing flows in networks of small treewidth ⋮ Generalized \(p\)-center problems: Complexity results and approximation algorithms ⋮ A linear program for the two-hub location problem ⋮ A heuristic algorithm for the mini-max spanning forest problem ⋮ A polynomially solvable class of quadratic semi-assignment problems ⋮ Algorithms for network piecewise-linear programs: A comparative study ⋮ Locomotive assignment with heterogeneous consists at CN North America ⋮ Planning models for freight transportation ⋮ Computational investigations of maximum flow algorithms ⋮ The assembly of printed circuit boards: A case with multiple machines and multiple board types ⋮ The balanced linear programming problem ⋮ A branch-and-bound algorithm for the mini-max spanning forest problem ⋮ Using an interior point method for the master problem in a decomposition approach ⋮ Multifleet routing and multistop flight scheduling for schedule perturbation ⋮ How hard is it to find extreme Nash equilibria in network congestion games? ⋮ A note on a generalized network flow model for manufacturing process ⋮ Cut generation for an integrated employee timetabling and production scheduling problem ⋮ Choosing robust solutions in discrete optimization problems with fuzzy costs ⋮ Uniform multicommodity flow through the complete graph with random edge-capacities ⋮ Two- and three-index formulations of the minimum cost multicommodity \(k\)-splittable flow problem ⋮ A solution method for a car fleet management problem with maintenance constraints ⋮ On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls ⋮ Graph coloring with cardinality constraints on the neighborhoods ⋮ New algorithms for convex cost tension problem with application to computer vision ⋮ Labeling algorithms for multiple objective integer knapsack problems ⋮ On the \(K\) shortest path trees problem ⋮ A primal-dual simplex algorithm for bi-objective network flow problems ⋮ Diagnosing infeasibilities in network flow problems ⋮ The bottleneck \(k\)-MST ⋮ Restricted reallocation of resources ⋮ Multicuts and integral multiflows in rings ⋮ On the computation of all supported efficient solutions in multi-objective integer network flow problems ⋮ A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning ⋮ Clique inference process for solving Max-CSP ⋮ On-line integrated production-distribution scheduling problems with capacitated deliveries ⋮ Application of fuzzy minimum cost flow problems to network design under uncertainty ⋮ Solving the 2-rooted mini-max spanning forest problem by branch-and-bound ⋮ Two flow network simplification algorithms ⋮ Two-terminal routing games with unknown active players

This page was built for publication: