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)

A network flow model of group technology ⋮ Decoding turbo-like codes via linear programming ⋮ A biased random-key genetic algorithm for road congestion minimization ⋮ Integer matrices with constraints on leading partial row and column sums ⋮ Optimal placement of UV-based communications relay nodes ⋮ A heuristic method for the minimum toll booth problem ⋮ Distributive lattices, polyhedra, and generalized flows ⋮ Multi-objective and multi-constrained non-additive shortest path problems ⋮ On scheduling a single machine with resource dependent release times ⋮ A note on permutations and rank aggregation ⋮ The off-line group seat reservation problem ⋮ A heuristic algorithm for hierarchical hub-and-spoke network of time-definite common carrier operation planning problem ⋮ Remarks on Afriat's theorem and the Monge-Kantorovich problem ⋮ On the second point-to-point undirected shortest simple path problem ⋮ Multiple machine continuous setup lotsizing with sequence-dependent setups ⋮ The total adjustment cost problem: applications, models, and solution algorithms ⋮ Pricing with markups in industries with increasing marginal costs ⋮ On the approximability of robust spanning tree problems ⋮ Shortest path and maximum flow problems in networks with additive losses and gains ⋮ Scheduling large-scale micro/nano biochemical testing: Exact and heuristic algorithms ⋮ A polynomial oracle-time algorithm for convex integer minimization ⋮ Simplifying maximum flow computations: the effect of shrinking and good initial flows ⋮ Monotonicity recovering and accuracy preserving optimization methods for postprocessing finite element solutions ⋮ Finding total unimodularity in optimization problems solved by linear programs ⋮ Network flow problems with pricing decisions ⋮ On 2-stage robust LP with RHS uncertainty: complexity results and applications ⋮ An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints ⋮ New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints ⋮ Optimization models for assessing the peak capacity utilization of intelligent transportation systems ⋮ Recent advances in optimization techniques for statistical tabular data protection ⋮ Minimal-cost network flow problems with variable lower bounds on arc flows ⋮ Finding the shortest paths by node combination ⋮ Minmax regret bottleneck problems with solution-induced interval uncertainty structure ⋮ Maximum flow in directed planar graphs with vertex capacities ⋮ Possibilistic bottleneck combinatorial optimization problems with ill-known weights ⋮ Partitioning planar graphs: a fast combinatorial approach for max-cut ⋮ An efficient label setting/correcting shortest path algorithm ⋮ Constraint-based very large-scale neighborhood search ⋮ House allocation with fractional endowments ⋮ Strictly periodic scheduling in IMA-based architectures ⋮ Connectivity-and-hop-constrained design of electricity distribution networks ⋮ Modeling wildfire propagation with Delaunay triangulation and shortest path algorithms ⋮ An \(O(m(m+n\log {n})\log(nC))\)-time algorithm to solve the minimum cost tension problem ⋮ An efficient time and space \(K\) point-to-point shortest simple paths algorithm ⋮ The capacitated \(p\)-hub median problem with integral constraints: an application to a Chinese air cargo network ⋮ Automated knowledge source selection and service composition ⋮ On solving continuous-time dynamic network flows ⋮ Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms ⋮ Control of limit states in absorbing resource networks ⋮ Selfish splittable flows and NP-completeness ⋮ Entropy methods for identifying hedonic models ⋮ 2-layer right angle crossing drawings ⋮ Implicit computation of maximum bipartite matchings by sublinear functional operations ⋮ Computing the asymptotic spectrum for networks representing energy landscapes using the minimum spanning tree ⋮ Combinatorial optimization problems with uncertain costs and the OWA criterion ⋮ Optimal design of virtual links in AFDX networks ⋮ LS(graph): a constraint-based local search for constraint optimization on trees and paths ⋮ Weighted matching as a generic pruning technique applied to optimization constraints ⋮ Maximum weight archipelago subgraph problem ⋮ Tailored Lagrangian relaxation for the open pit block sequencing problem ⋮ A decomposition approach for commodity pickup and delivery with time-windows under uncertainty ⋮ Interval graph representation with given interval and intersection lengths ⋮ Maximum probability shortest path problem ⋮ Exterior point simplex-type algorithms for linear and network optimization problems ⋮ Scheduling problem with multi-purpose parallel machines ⋮ Fractional routing using pairs of failure-disjoint paths ⋮ Evaluating the reliability of a novel deterioration-effect multi-state flow network ⋮ A fuzzy time-dependent project scheduling problem ⋮ The edge-recoloring cost of monochromatic and properly edge-colored paths and cycles ⋮ Processing time-dependent shortest path queries without pre-computed speed information on road networks ⋮ Web services composition: complexity and models ⋮ About the minimum mean cycle-canceling algorithm ⋮ A new approach for solving the network problems ⋮ A modified active set algorithm for transportation discrete network design bi-level problem ⋮ Local search algorithm for universal facility location problem with linear penalties ⋮ Pareto optimal matchings in many-to-many markets with ties ⋮ Relational linear programming ⋮ Analysis of budget for interdiction on multicommodity network flows ⋮ Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios ⋮ A multi-objective, hub-and-spoke model to design and manage biofuel supply chains ⋮ Alternating sign matrices, extensions and related cones ⋮ Graph cuts with interacting edge weights: examples, approximations, and algorithms ⋮ Composability and controllability of structural linear time-invariant systems: distributed verification ⋮ The complexity of finding effectors ⋮ Lattice flows in networks ⋮ A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem ⋮ A specialized network simplex algorithm for the constrained maximum flow problem ⋮ A reduction approach to the repeated assignment problem ⋮ Improving LTL truck load utilization on line ⋮ A direct barter model for course add/drop process ⋮ Planning wireless networks by shortest path ⋮ On robust online scheduling algorithms ⋮ Personnel scheduling: models and complexity ⋮ Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems ⋮ Domino portrait generation: a fast and scalable approach ⋮ Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE ⋮ Treewidth computations. II. Lower bounds ⋮ A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminals ⋮ The give-up problem for blocked regional lists with multi-winners ⋮ Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships

This page was built for publication: