Publication:3056948

zbMath1201.90001MaRDI QIDQ3056948

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

Publication date: 23 November 2010

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B10: Deterministic network models in operations research

90-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming

90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming

Related Items

Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem., Lorentz gas cellular automata on graphs., Operational planning of a large-scale multi-modal transportation system., Fuzzy shortest path problems incorporating interactivity among paths., Finding the first \(K\) shortest paths in a time-window network., On treewidth approximations., The composition of semi-finished inventories at a solid board plant., Inapproximability and a polynomially solvable special case of a network improvement problem., A short proof of a theorem of Falmagne., Fast pattern matching in indexed texts, Computational analysis of a flexible assembly system design problem, Heuristic and exact algorithms for the simultaneous assignment problem, Inverse problems of submodular functions on digraphs, Some reverse location problems, Exact and heuristic algorithms for data sets reconstruction, An improved approximation algorithm of MULTIWAY CUT., A new dual based procedure for the transportation problem, Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem, The biobjective minimum cost flow problem, Generalized spanning trees, An evolutionary approach for finding optimal trees in undirected networks, The capacitated multiple allocation hub location problem: Formulations and algorithms, Planning models for long-haul operations of postal and express shipment companies, A comparison of different solution approaches to the vehicle scheduling problem in a practical case, Heuristic and exact algorithms for the precedence-constrained knapsack problem, Semi-dynamic breadth-first search in digraphs, Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints, Digital data networks design using genetic algorithms, A parallel primal-dual simplex algorithm, Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite, On the flow cost lowering problem, Multiscale skeletons by image foresting transform and its application to neuromorphometry, Finding all the negative cycles in a directed graph, New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization, A passenger demand model for airline flight scheduling and fleet routing, Multiparametric demand transportation problem, Simultaneous lotsizing and scheduling on parallel machines, An implementation of the iterative proportional fitting procedure by propagation trees., Approximating the maximum quadratic assignment problem, Theory of uncontrollable flows -- a new type of network-flow theory as a model for the 21st century of multiple values, Experimental results on quadrangulations of sets of fixed points, Compact vs. exponential-size LP relaxations, Large-scale optimization planning methods for the distribution of United States army munitions, Network design formulations for scheduling U.S. air force channel route missions, Solving a combinatorial problem with network flows, Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs, Improved approximation algorithms for capacitated facility location problems, A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem, Use of primal-dual technique in the network algorithm for two-way contingency tables, Weighted inverse minimum spanning tree problems under Hamming distance, Resource allocation decisions under various demands and cost requirements in an unreliable flow network, Exact disclosure prevention in two-dimensional statistical tables, An iterative improvement approach for the nonpreemptive open shop scheduling problem, Iterative bundle-based decomposition for large-scale nonseparable convex optimization, The problem of the optimal biobjective spanning tree, The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints, On the inverse problem of linear programming and its application to minimum weight perfect \(k\)-matching, Probabilistic local search algorithms for concave cost transportation network problems, Resource levelling for projects with schedule-dependent time windows, Stochastic comparisons and couplings for interacting particle systems, Notes on polyhedra associated with hop-constrained paths, Generalized network design problems., Parametric min-cuts analysis in a network., Characterizing the flow equivalent trees of a network, A lower bound for the job insertion problem., A maximum flow algorithm using MA ordering., A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem., A demand-shifting feasibility algorithm for Benders decomposition., An approximation algorithm for computing longest paths., Polybasic polyhedra: Structure of polyhedra with edge vectors of support size at most 2, Interval data minmax regret network optimization problems, Strong lower bounds for the prize collecting Steiner problem in graphs, Extension of M-convexity and L-convexity to polyhedral convex functions, LP models for bin packing and cutting stock problems, Infrastructure development for conversion to environmentally friendly fuel, A network model for airline cabin crew scheduling, The transportation problem with exclusionary side constraints and two branch-and-bound algorithms, Parametric analysis of overall min-cuts and applications in undirected networks., Approximation algorithms for routing and call scheduling in all-optical chains and rings., Minimizing subsequential transducers: a survey., Mobile data and transaction management, A network simplex algorithm with O(\(n\)) consecutive degenerate pivots, Obtaining a good primal solution to the uncapacitated transportation problem, Minimization of travel time and weighted number of stops in a traffic-light network, Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks, A heuristic for the continuous capacity and flow assignment, A branch and bound to minimize the number of late jobs on a single machine with release time constraints, Uncapacitated point-to-multipoint network flow problem and its application to multicasting in telecommunication networks, Some constrained partitioning problems and majorization, Representation and management of MOEA populations based on graphs, The construction of stable project baseline schedules, A decomposition approach for an equipment selection and multiple product routing problem incorporating environmental factors, Sequential and parallel algorithms for minimum flows., Improving time bounds on maximum generalised flow computations by contracting the network, Decision support for the career field selection process at the US Air Force Academy, Polynomial approximation schemes and exact algorithms for optimum curve segmentation problems, Heuristic and exact algorithms for the spanning tree detection problem, An exact algorithm for the robust shortest path problem with interval data, A generalization of the scaling max-flow algorithm, A label-setting algorithm for finding a quickest path, On the complexity of the \(k\)-customer vehicle routing problem, Reliable and economic resource allocation in an unreliable flow network, Graceful reassignment of excessively long communications paths in networks, A note on \(K\) best network flows, An exact algorithm for the capacitated shortest spanning arborescence, On the partial order polytope of a digraph, A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms, A hybrid algorithm for the solution of a single commodity spatial equilibrium model, Optimum path packing on wheels: The consecutive case, Designing and reporting on computational experiments with heuristic methods, Calculating some inverse linear programming problems, Tree partitioning under constraints. -- Clustering for vehicle routing problems, Asymptotic optimality of a transport-problem plan constructed by the minimum-element method, On finding dissimilar paths, Shortest paths in a network with time-dependent flow speeds, A new scaling algorithm for the minimum cost network flow problem, Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints, Stochastic comparisons for general probabilistic cellular automata, A minimum mean cycle cancelling method for nonlinear multicommodity flow problems, An adaptive time slot assignment algorithm for variable bandwidth switching systems, Optimization models for forest road upgrade planning, Planning and approximation models for delivery route based services with price-sensitive demands, A pegging approach to the precedence-constrained knapsack problem, Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly, Optimal flow through the disordered lattice, Remarks on the application of genetic algorithm and tabu search method to nonlinear spanning tree problems, The shortest path problem on networks with fuzzy parameters, A faster combinatorial approximation algorithm for scheduling unrelated parallel machines, A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows, Preemptive benchmarking problem: An approach for official statistics in small areas, A remark on a standard and linear vector network equilibrium problem with capacity constraints, Image restoration with discrete constrained total variation. II: Levelable functions, convex priors and non-convex cases, A network flow algorithm for reconstructing binary images from discrete X-rays, Comparative tests of solution methods for signal-controlled road networks, Parallel machine scheduling with machine availability and eligibility constraints, Circulation of railway rolling stock: a branch-and-price approach, Max-min fairness in multi-commodity flows, Modeling and solving the rooted distance-constrained minimum spanning tree problem, Ranking function-based solutions of fully fuzzified minimal cost flow problem, Lot-sizing with fixed charges on stocks: the convex hull, A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem, Base station location and channel allocation in a cellular network with emergency coverage requirements, Two new algorithms for UMTS access network topology design, A quadratic time algorithm to maximize the number of just-in-time jobs on identical parallel machines, Fuzzy approach to multilevel knapsack problems, The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches, A strongly polynomial algorithm for line search in submodular polyhedra, Algorithms for the multiple label placement problem, Reachability cuts for the vehicle routing problem with time windows, Cost-based filtering for shorter path constraints, Two phase algorithms for the bi-objective assignment problem, Lexicographic maximin optimisation for fair bandwidth allocation in computer networks, The fractional weak discrepancy of a partially ordered set, Lot-sizing with non-stationary cumulative capacities, Maximum flow problem in wireless ad hoc networks with directional antennas, Cell suppression problem: A genetic-based approach, Discrete-time dynamic traffic assignment models with periodic planning horizon: system optimum, Weak monotonicity and Bayes-Nash incentive compatibility, Hierarchical maximal-coverage location-allocation: case of generalized search-and-rescue, A bilevel mixed-integer program for critical infrastructure protection planning, Matching point sets with respect to the earth mover's distance, Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths, Reducing rank-maximal to maximum weight matching, Algorithms for time-dependent bicriteria shortest path problems, Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints, A zero-space algorithm for negative cost cycle detection in networks, Steiner diagrams and \(k\)-star hubs, On the job rotation problem, A model to optimize placement operations on dual-head placement machines, Lot sizing with inventory gains, Optimization with binet matrices, A survey of recent developments in multiobjective optimization, Methods based on discrete optimization for finding road network rehabilitation strategies, Geometric problems in automated manufacturing., The minimum shift design problem, Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements, Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths, Detecting highly oscillatory signals by chirplet path pursuit, Primal-dual simplex method for multiobjective linear programming, Efficient preflow push algorithms, Using mixed-integer programming to solve power grid blackout problems, Time offset optimization in digital broadcasting, Best routes selection in international intermodal networks, The prize-collecting generalized minimum spanning tree problem, On multiparametric analysis in network linear programming., A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems, A note on the parametric maximum flow problem and some related reoptimization issues, Combinatorial auctions, Complexity and algorithms for nonlinear optimization problems, Resource extension functions: properties, inversion, and generalization to segments, Convergent Lagrangian heuristics for nonlinear minimum cost network flows, Multiobjective service restoration in electric distribution networks using a local search based heuristic, Network design and flow problems with cross-arc costs, On the sphericity testing of single source digraphs, An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs, An algorithm for ranking assignments using reoptimization, A method for approximating symmetrically reciprocal matrices by transitive matrices, Determination of the candidate arc set for the asymmetric traveling salesman problem, A solvable case of image reconstruction in discrete tomography, A branch-and-cut algorithm for scheduling of projects with variable-intensity activities, GIDEN, Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships, A network flow model of group technology, Decoding turbo-like codes via linear programming, Non-standard approaches to integer programming, Scheduling and constraint propagation, Graph connectivity and its augmentation: Applications of MA orderings, Strongly linear trend-free block designs and 1-factors of representative graphs, A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses, Computational experience with exterior point algorithms for the transportation problem, Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines., Models and methods for standardization problems, A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery, Chips on wafers, or packing rectangles into grids, \(L_{1}\) cheapest paths in ``Fjord scenery, A combinatorial approximation algorithm for concurrent flow problem and its application, The biobjective undirected two-commodity minimum cost flow problem, Minimal multicut and maximal integer multiflow: a survey, Bounding probabilistic relationships in Bayesian networks using qualitative influences: methods and applications, Project scheduling with irregular costs: complexity, approximability, and algorithms, Used car salesman problem: a differential auction-barter market, A manufacturing supply chain optimization model for distilling process, An efficient bounds consistency algorithm for the global cardinality constraint, Dynamic pricing and the direct-to-customer model in the automotive industry, Parameterized graph separation problems, Estimation of flows in flow networks, The TV-break packing problem, Multiple objective minimum cost flow problems: a review, A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times, Attribute value reordering for efficient hybrid OLAP, On combinatorial optimization problems on matroids with uncertain weights, Balancing staffing and switching costs in a service center with flexible servers, Multiperiod integrated routing and scheduling of World Food Programme cargo planes in Angola, Efficient primal-dual heuristic for a dynamic location problem, The combined cutting stock and lot-sizing problem in industrial processes, Fixed interval scheduling: models, applications, computational complexity and algorithms, A solution to the random assignment problem on the full preference domain, How to collect balls moving in the Euclidean plane, Complexity and approximability of \(k\)-splittable flows, Minimum spanning trees in networks with varying edge weights, Using error bounds to compare aggregated generalized transportation models, Fuzzy shortest path problem with finite fuzzy quantities, The container transshipment problem: searching representation landscapes with metaheuristic algorithms, Bilevel time minimizing assignment problem, Balanced home-away assignments, An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality, Design of the federal express large package sort facility, Direct graph \(k\)-partitioning with a Kernighan-Lin like heuristic, Computational approaches to a combinatorial optimization problem arising from text classification, Heuristic approaches for batching jobs in printed circuit board assembly, Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints, Enhanced second order algorithm applied to the capacitated minimum spanning tree problem, Resource assignment with preference conditions, On-line supply chain scheduling problems with preemption, Inverse minimum flow problem, Two fast algorithms for all-pairs shortest paths, Minimizing total weighted tardiness in a generalized job shop, Inverse min-max spanning tree problem under the weighted sum-type Hamming distance, New models for shortest path problem with fuzzy arc lengths, Treewidth lower bounds with brambles, Maximum \(k\)-splittable \(s, t\)-flows, On short paths interdiction problems: Total and node-wise limited interdiction, Preemptive scheduling on uniform parallel machines with controllable job processing times, A tabu search heuristic for the generalized minimum spanning tree problem, A Branch and Price algorithm for the \(k\)-splittable maximum flow problem, Searching for a trail of evidence in a maze, Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks, Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem, Pruning in column generation for service vehicle dispatching, Some observations about the extreme points of the generalized cardinality-constrained shortest path problem polytope, A double scaling algorithm for the constrained maximum flow problem, Heuristics for automated knowledge source integration and service composition, On a generalization of the Gallai-Roy-Vitaver theorem to the bandwidth coloring problem, Minimizing a monotone concave function with laminar covering constraints, The solution and duality of imprecise network problems, Transportation matrices with staircase patterns and majorization, A model and heuristic algorithms for multi-unit nondiscriminatory combinatorial auction, The stable set polytope of quasi-line graphs, On the \(p\)-median polytope of \(Y\)-free graphs, Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities, The \(k\)-path tree matroid and its applications to survivable network design, \(\varepsilon \)-optimization schemes and \(L\)-bit precision: alternative perspectives for solving combinatorial optimization problems, Extended dominance and a stochastic shortest path problem, Scheduling tests in automotive R\&D projects, Identical part production in cyclic robotic cells: Concepts, overview and open questions, Finding rectilinear least cost paths in the presence of convex polygonal congested regions, A network flow approach in finding maximum likelihood estimate of high concentration regions, On polynomial cases of the unichain classification problem for Markov decision processes, Network flow-based approaches for integrated aircraft fleeting and routing, A comparison of solution strategies for biobjective shortest path problems, Network location of a reliable center using the most reliable route policy, The \(k\)-centrum shortest path problem, Rake linking for suburban train services, 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, 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, Finding integer efficient solutions for bicriteria and tricriteria network flow problems using DINAS, A heuristic for blocking flow algorithms, An implementation of linear and nonlinear multicommodity network flows, 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, The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable, A fast bipartite network flow algorithm for selective assembly, Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms, A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges, 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, Diagnosing infeasibilities in network flow problems, Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem, A multi-modal approach to the location of a rapid transit line, Classical and new heuristics for the open-shop problem: A computational evaluation, A capacity allocation problem with integer side constraints, A two-level network for recycling sand: A case study, Economic spare capacity planning for DCS mesh-restorable networks, Constrained weighted matchings and edge coverings in graphs, A self-stabilizing distributed algorithm to find the median of a tree graph, Exact solution of multicommodity network optimization problems with general step cost functions, A new matrix bandwidth reduction algorithm, Lexicographic bottleneck combinatorial problems, On the complexity of the dual method for maximum balanced flows, Dynamic programming and graph optimization problems, On spanning tree problems with multiple objectives, An incremental primal-dual method for generalized networks, Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems, A primal-dual interior point method whose running time depends only on the constraint matrix, On bicriterion minimal spanning trees: An approximation, Solving nonlinear multicommodity flow problems by the analytic center cutting plane method, Equivalence of the primal and dual simplex algorithms for the maximum flow problem, Minimizing a linear multiplicative-type function under network flow constraints, Applying steepest-edge techniques to a network primal-dual algorithm, A capacity scaling algorithm for convex cost submodular flows, Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time, The \(k\)-cardinality assignment problem, Maximal closure on a graph with resource constraints, A design of the minimum cost ring-chain network with dual-homing survivability: A tabu search approach, Single machine scheduling with discretely controllable processing times, A polynomial time primal network simplex algorithm for minimum cost flows, A new strongly polynomial dual network simplex algorithm, A new pivot selection rule for the network simplex algorithm, On strongly polynomial dual simplex algorithms for the maximum flow problem, How to compute least infeasible flows, Flows on hypergraphs, Multiflows and disjoint paths of minimum total cost, On the complexity of two machine job-shop scheduling with regular objective functions, Strongly polynomial dual simplex methods for the maximum flow problem, A simplex algorithm for a class of Leontief flow problems, A doubly cyclic channel assignment problem, Converting triangulations to quadrangulations, Maximum \((s,t)\)-flows in planar networks in \(\mathcal O(|V| \log |V|)\) time, Interdicting the activities of a linear program -- a parametric analysis, Compact location problems, Satisfiability problems on intervals and unit intervals, Order-based neighborhoods for project scheduling with nonregular objective functions., A fully dynamic algorithm for distributed shortest paths., Network simplex algorithm for the general equal flow problem., A hybrid algorithm for solving network flow problems with side constraints., Least possible time paths in stochastic, time-varying networks., Finding all essential terms of a characteristic maxpolynomial., Which matrices are immune against the transportation paradox?, An interactive approach for integrated multilevel systems in a fuzzy environment, A variable neighborhood search for graph coloring., Using software complexity measures to analyze algorithms -- an experiment with the shortest-paths algorithms., An interactive procedure dedicated to a bicriteria plant location model., Solving bicriteria 0--1 knapsack problems using a labeling algorithm., A new algorithm for reoptimizing shortest paths when the arc costs change, Reconstructing edge-disjoint paths., A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time, Global constraints for round robin tournament scheduling., Solving group Steiner problems as Steiner problems., A note on the assignment problem with seniority and job priority constraints., Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network., Open shop scheduling problems with late work criteria., Minimization of Energy Losses in Electric Power Distribution Systems by Intelligent Search Strategies, Optimal designs for simultaneous item estimation, Distribution-routes stability analysis of the transportation problem, Dynamic shortest paths minimizing travel times and costs, The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm, Large-scale local search heuristics for the capacitated vertexp-center problem, A directed cycle-based column-and-cut generation method for capacitated survivable network design, Random-tree Diameter and the Diameter-constrained MST, THE ASSIGNMENT OF INDIVIDUAL RENEWABLE RESOURCES IN SCHEDULING, Solving the undirected minimum cost flow problem with arbitrary costs, Local conditions for the stochastic comparison of particle systems, A comprehensive simplex-like algorithm for network optimization and perturbation analysis, An improved direct labeling method for the max-flow min-cut computation in large hypergraphs and applications, GEOMETRIC ALGORITHMS FOR STATIC LEAF SEQUENCING PROBLEMS IN RADIATION THERAPY, Fast and Scalable Domino Portrait Generation, Structural Change and Homeostasis in Organizations: A Decision-Theoretic Approach, Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy, GENERALIZED GEOMETRIC APPROACHES FOR LEAF SEQUENCING PROBLEMS IN RADIATION THERAPY, INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS, Analyse de sensibilité pour les problèmes linéaires en variables 0-1, Modeling and solving the periodic maintenance problem, Accelerating column generation for aircraft scheduling using constraint propagation, On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection, Efficient operation of natural gas transmission systems: a network-based heuristic for cyclic structures, Using Lagrangian dual information to generate degree constrained spanning trees, Path problems in generalized stars, complete graphs, and brick wall graphs, Decomposition and dynamic cut generation in integer linear programming, Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem, Creating very large scale neighborhoods out of smaller ones by compounding moves, Multicriteria adaptive paths in stochastic, time-varying networks, An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints, A combinatorial algorithm for weighted stable sets in bipartite graphs, Combinatorial algorithms for the minimum interval cost flow problem, Dial-up internet access: a two-provider cost model, Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs, A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem, On the severity of Braess's paradox: designing networks for selfish users is hard, Construction for bicritical graphs and \(k\)-extendable bipartite graphs, Heuristic shortest path algorithms for transportation applications: state of the art, Solving a class of stochastic mixed-integer programs with branch and price, Scheduling unit-length jobs with machine eligibility restrictions, A Benders decomposition approach for the robust spanning tree problem with interval data, Network flow approaches to pre-emptive open-shop scheduling problems with time-windows, A class of node based bottleneck improvement problems, An efficient approach for the rank aggregation problem, A local relaxation approach for the siting of electrical substations, On global warming: Flow-based soft global constraints, Airport management: taxi planning, A surface reconstruction method using global graph cut optimization, Minimal invariant sets in a vertex-weighted graph, Shortest paths in piecewise continuous time-dependent networks, Optimal solution of the discrete cost multicommodity network design problem, Submodular containment is hard, even for networks, An assignment model for dynamic load planning of intermodal trains, On uniform \(k\)-partition problems, Multicriteria scheduling, Multicast tree rearrangement to recover node failures in overlay multicast networks, Scheduling unit length jobs with parallel nested machine processing set restrictions, The computation of Cournot-Nash equilibria for the time-definite freight delivery industry under an oligopolistic market, Bucket brigades on in-tree assembly networks, Models and algorithm for stochastic shortest path problem, Bid evaluation in procurement auctions with piecewise linear supply curves, An evolutionary algorithm for discrete tomography, Optimization and reconstruction of \(hv\)-convex (0,1)-matrices, Exact and approximate balanced data gathering in energy-constrained sensor networks, Some inverse optimization problems under the Hamming distance, Robotic-cell scheduling: special polynomially solvable cases of the traveling salesman problem on permuted Monge matrices, Linear tolls suffice: new bounds and algorithms for tolls in single source networks, Multiroute flows: cut-trees and realizability, Substitutes and complements in network flows viewed as discrete convexity, Reduction from three-dimensional discrete tomography to multicommodity flow problem, Time-dependent shortest paths through a fixed sequence of nodes: application to a travel planning problem, Projection results for vehicle routing, Maximum network flow with floating point arithmetic., On budget-constrained flow improvement., An improved algorithm for decomposing arc flows into multipath flows, The multiple TSP with time windows: vehicle bounds based on precedence graphs, Tabu search algorithm for flexible flow path design of unidirectional automated-guided vehicle systems, A conversion of an SDP having free variables into the standard form SDP, Prim-based support-graph preconditioners for min-cost flow problems, The maximum integer multiterminal flow problem in directed graphs, Local optimality conditions for multicommodity flow problems with separable piecewise convex costs, On generalized semi-infinite optimization of genetic networks, Optimization and reconstruction of hv-convex (0,1)-matrices, Dynamic programming algorithms for the elementary shortest path problem with resource constraints, A new algorithm for 3D binary tomography, Reconstruction of binary matrices under adjacency constraints, Minimum-Weight Cycle Covers and Their Approximability, Efficient Algorithms for the k Smallest Cuts Enumeration, Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities, Column Generation Algorithms for the Capacitated m-Ring-Star Problem, Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint, MOUNTAIN REDUCTION, BLOCK MATCHING, AND APPLICATIONS IN INTENSITY-MODULATED RADIATION THERAPY, Circulations, Fuzzy Relations and Semirings, Minimum work paths in elevated networks, Approximating Multi-criteria Max-TSP, Valid cycles: A source of infeasibility in open shortest path first routing, The inverse maximum flow problem consideringl_∞norm, Peak Shaving through Resource Buffering, Optimizing the US Navy's combat logistics force, Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité, BRIDGE LANE DIRECTION SPECIFICATION FOR SUSTAINABLE TRAFFIC MANAGEMENT, Bicolored matchings in some classes of graphs, An algorithm for the biobjective integer minimum cost flow problem, Search for MC in modified networks, Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks, Shortest paths in almost acyclic graphs, Matrices of zeros and ones with given line sums and a zero block, Possible line sums for a qualitative matrix, Improved methods of assembly sequence determination for automatic assembly systems, Time-varying minimum cost flow problems, A class of bottleneck expansion problems, An algorithm for finding the first excited state in the random-field Ising model, The projected pairwise multicommodity flow polyhedron, Isotone functions, dual cones, and networks, Optimal collective dichotomous choice under partial order constraints, TSP tour domination and Hamilton cycle decompositions of regular digraphs, The complexity of path coloring and call scheduling, Reconstruction of domino tiling from its two orthogonal projections, Planning as heuristic search, Matrices of zeros and ones with given line sums and a zero block, Robust partial inverse network flow problems, Models for a Steiner ring network design problem with revenues, A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times, Planning and control in artificial intelligence: A unifying perspective, Facets of the \(p\)-cycle polytope, Local search algorithms for a single-machine scheduling problem with positive and negative time-lags, Euler is standing in line dial-a-ride problems with precedence-constraints, The robust spanning tree problem with interval data, An efficient network flow code for finding all minimum cost \(s-t\) cutsets, Airline cockpit crew scheduling, Optimal locations of switches and interconnections for ATM LANs, Partitioning a matrix with non-guillotine cuts to minimize the maximum cost, Optimal construction of airline individual crew pairings., Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs, Minimizing the number of tardy jobs with precedence constraints and agreeable due dates