scientific article

Publication date: 1976

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

computational complexity integer programming network programming combinatorial optimization matroids network flow algorithms matroid intersection algorithm polynomially bounded algorithms augmenting paths matroid greedy algorithm out-of-kilter algorithm bipartite and nonbipartite networks Np- hard problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Integer programming (90C10) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Maximal dynamic polymatroid flows and applications, Experimental evaluation of a local search approximation algorithm for the multiway cut problem, Hierarchical $b$-matching, Euclidean maximum matchings in the plane -- local to global, Branch-and-price algorithm for the resilient multi-level hop-constrained network design, Optimal relay node placement in delay constrained wireless sensor network design, A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem, Complexity results for storage loading problems with stacking constraints, Community detection by modularity maximization using GRASP with path relinking, Fuzzy shortest path problem with finite fuzzy quantities, The theory and practice of distance geometry, Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints, Algorithms for the quickest path problem and the reliable quickest path problem, Optimal placement of UV-based communications relay nodes, Solution of the Liu-Layland problem via bottleneck just-in-time sequencing, Single processor scheduling with job values depending on their completion times, The weak robustness of interval matrices in max-plus algebra, NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting, Parameterized and subexponential-time complexity of satisfiability problems and applications, Stability analysis in discrete optimization involving generalized addition operations, Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation, Matching based very large-scale neighborhoods for parallel machine scheduling, On flows in simple bidirected and skew-symmetric networks, Spatio-temporal multi-robot routing, A multicast routing algorithm based on searching in directed graph, Linear-code multicast on parallel architectures, Bee colony optimization for the $p$-center problem, Possibilistic bottleneck combinatorial optimization problems with ill-known weights, Partitioning planar graphs: a fast combinatorial approach for max-cut, Scheduling of project networks, The generalized assignment problem: Valid inequalities and facets, Partitioning multi-edge graphs, Polynomial time approximation schemes for the constrained minimum spanning tree problem, A survey of dynamic network flows, Reconstructing shortest paths, Retiming synchronous circuitry, The ``molecular traveling salesman, An algorithm for weighted fractional matroid matching, A $(2-c\frac{1}{\sqrt{N}})$-approximation algorithm for the stable marriage problem, Lower bounds and modified LPT algorithm for $k$-partitioning problems with partition matroid constraint, A model for minimizing active processor time, An overview of channel assignment methods for multi-radio multi-channel wireless mesh networks, A column generation approach for multicast routing and wavelength assignment with delay constraints in heterogeneous WDM networks, Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs, On set expansion problems and the small set expansion conjecture, The Steiner tree problem with delays: a compact formulation and reduction procedures, Phase transition on the convergence rate of parameter estimation under an Ornstein-Uhlenbeck diffusion on a tree, A new approach for solving the network problems, Greed is good: Approximating independent sets in sparse and bounded-degree graphs, George Dantzig's impact on the theory of computation, The $k$-path tree matroid and its applications to survivable network design, Finding Hamiltonian circuits in quasi-adjoint graphs, Bounded discrete representations of interval orders, Hierarchical decomposition of symmetric discrete systems by matroid and group theories, Approximating the tree and tour covers of a graph, On worst-case aggregation analysis for network location problems, Commitment under uncertainty: Two-stage stochastic matching problems, Complexity of the sex-equal stable marriage problem, Using combinatorial optimization in model-based trimmed clustering with cardinality constraints, Shape rectangularization problems in intensity-modulated radiation therapy, The central curve in linear programming, Semigroup identities in the monoid of two-by-two tropical matrices., Maximum outflow in generalized flow networks, Maximum sum-of-splits clustering, Partial inverse of a monotone operator, A novel iterative shape from focus algorithm based on combinatorial optimization, Blossom V: A new implementation of a minimum cost perfect matching algorithm, Recognizing underlying sparsity in optimization, Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey, Making sparse matrices sparser: Computational results, $k$-partitioning problems with partition matroid constraint, Approximating the maximum clique minor and some subgraph homeomorphism problems, Structural theorems for submodular functions, polymatroids and polymatroid intersections, A polynomial algorithm for minimum quadratic cost flow problems, An extension of labeling techniques for finding shortest path trees, Persistency and matroid intersection, A note on a generalized network flow model for manufacturing process, On matroid parity and matching polytopes, Approximating the longest path length of a stochastic DAG by a normal distribution in linear time, Recent trends in combinatorial optimization, An equivalent subproblem relaxation for improving the solution of a class of transportation scheduling problems, Nowhere-zero integral flows on a bidirected graph, Optimal cycles in doubly weighted graphs and approximation of bivariate functions by univariate ones, On the number of common bases of two matroids, A matroid generalization of theorems of Lewin and Gallai, Networks and chain coverings in partial orders and their products, Applications of shortest path algorithms to matrix scalings, Worst-case choice for the stable marriage problem, Label-connected graphs and the gossip problem, Fuzzy shortest paths, Additive functions and their application to uncertain information, Chain packing in graphs, An algorithm for finding a matroid basis which maximizes the product of the weights of the elements, A dynamic programming algorithm to find all solutions in a neighborhood of the optimum, An efficient Dijkstra-like labeling method for computing shortest odd/even paths, Computational experience with a polynomial-time dual simplex algorithm for the transportation problem, Algorithms for the minimum weight of linear codes, Fast algorithms for the undirected negative cost cycle detection problem, PTAS for densest $k$-subgraph in interval graphs, Combinatorics of orientation reversing polygons, Balancing problems in acyclic networks, The shortest path problem with two objective functions, Interval orders without odd crowns are defect optimal, Optimal precision in the presence of uncertainty, The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets, New algorithms for generalized network flows, Efficient inference in Bayes networks as a combinatorial optimization problem, A modified greedy heuristic for the set covering problem with improved worst case bound, A comment on $NP=P?'$ and restricted partitions, A shortest augmenting path algorithm for dense and sparse linear assignment problems, Matroids and a forest cover problem, A decomposition theory for matroids. III. Decomposition conditions, On lattices with Möbius function $\pm 1,0$, An augmenting path algorithm for linear matroid parity, Maximum number of disjoint paths connecting specified terminals in a graph, On-line updating of solutions to a class of matroid intersection problems, On the maximum 2-1 matching, Shortest-path problems and molecular conformation, Order statistics and the linear assignment problem, Undirected distances and the postman-structure of graphs, The strong chromatic number of partial triple systems, Approximation algorithms for weighted matching, Two probabilistic results on rectilinear Steiner trees, The complexity of computing best-response automata in repeated games, A polynomial algorithm for b-matchings: An alternative approach, Lower bounds on two-terminal network reliability, A matroid algorithm and its application to the efficient solution of two optimization problems on graphs, Large-scale network analysis with applications to transportation, communication and inference networks, k-optimal solution sets for some polynomially solvable scheduling problems, The complexity of matching with bonds, The minimal average cost flow problem, On maximal independent sets of vertices in claw-free graphs, Combinatorial problems over power sets, Matroid matching and some applications, An algorithm for generating all maximal independent subsets of posets, Worst case bounds for the Euclidean matching problem, Discrete extremal problems, An improvement in the Gavish-Shlifer algorithm for a class of transportation scheduling problems, On factors in random graphs, Parallel algorithms for the single source shortest path problem, Hybrid algorithm for sequencing with bicriteria, How to make a digraph strongly connected, An NP-complete matching problem, The ellipsoid method and its consequences in combinatorial optimization, The complexity of computing metric distances between partitions, The complexity of controlled selection, Use of dynamic trees in a network simplex algorithm for the maximum flow problem, Cooperative games arising from network flow problems, Polymatroids: Construction and random algorithms, The image of weighted combinatorial problems, An additive bounding procedure for the asymmetric travelling salesman problem, Finding minimum-cost flows by double scaling, Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource, Forests, frames, and games: Algorithms for matroid sums and applications, A fast algorithm for the generalized parametric minimum cut problem and applications, A linear-time algorithm to construct a rectilinear Steiner minimal tree for $k$-extremal point sets, Minimum spectral radius of a weighted graph, New scaling algorithms for the assignment and minimum mean cycle problems, A dynamic programming solution of a shortest path problem with time constraints on movement and parking, Negative circuits for flows and submodular flows, Path-matching problems, The complexity of computing a best response automaton in repeated games with mixed strategies, Solving the Euclidean bottleneck matching problem by $k$-relative neighborhood graphs, Delay structure conditions for identifiability of closed loop systems, Minimal cut cover of a graph with an application to the testing of electronic boards, A combinatorial interior point method for network flow problems, Crashing a maximum-weight complementary basis, Auction algorithms for network flow problems: A tutorial introduction, A note on the $f$-factor-lattice of bipartite graphs, A hierarchical algorithm for making sparse matrices sparser, Linear algorithms for testing the sign stability of a matrix and for finding Z-maximum matchings in acyclic graphs, Matroids, generalized networks, and electric network synthesis, Bimatroids and invariants, Note on a matroid with parity condition, Constructing disjoint paths on expander graphs, An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations, Approximation algorithms for minimum tree partition, Note on inverse problem with $l_\infty$ objective function, A fast bipartite network flow algorithm for selective assembly, The life span method -- a new variant of local search, Combinatorial optimization models for production scheduling in automated manufacturing systems, A dynamic programming heuristic for the $P$-median problem, Fenchel-type duality for matroid valuations, Random sampling and greedy sparsification for matroid optimization problems, Discrete convex analysis, An algorithm for a concave production cost network flow problem, Constrained weighted matchings and edge coverings in graphs, A recognition problem in converting linear programming to network flow models, Clustering heuristics for set covering, Modeling uncertainty in networks, Efficient enumeration of the vertices of polyhedra associated with network LP's, Efficient labelling algorithms for the maximum noncrossing matching problem, Modeling paradigms for discrete event simulation, Tight bounds on the number of minimum-mean cycle cancellations and related results, A faster parametric minimum-cut algorithm, Algorithms and complexity analysis for some flow problems, The maximum clique problem, Optimal loop storage allocation for argument-fetching dataflow machines, Tree polytope on 2-trees, A theory of alternating paths and blossoms for proving correctness of the $O(\sqrt{V}E)$ general graph maximum matching algorithm, A framework for the greedy algorithm, The real truth about star designs, The generalized dependency constrained spanning tree problem, The assignment problem revisited, An optimization modeling for customer redistribution and its spreadsheet implementation, Pareto-scheduling of two competing agents with their own equal processing times, Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form, Nonlinear neural networks for solving the shortest path problem, A constrained matching problem, On the core of the minimum cost Steiner tree game in networks, An efficient parallel algorithm for shortest paths in planar layered digraphs, Parallel machine scheduling with machine availability and eligibility constraints, Monotone labelings in polygonal tilings, An analytic symmetrization of max flow-min cut, Multicommodity network flow with jump constraints, Max-min matching problems with multiple assignments, Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems, Algorithms for solving the symmetry number problem on trees, A variable neighborhood search heuristic for the maximum ratio clique problem, Inverse matroid intersection problem, New algorithms for linear $k$-matroid intersection and matroid $k$-parity problems, Massively parallel augmenting path algorithms for the assignment problem, Approximate algorithms for the $P\parallel C_{\max}$ problem, An algebraic technique for generating optimal CMOS circuitry in linear time, An efficient cost scaling algorithm for the assignment problem, Flows on hypergraphs, Shortest paths algorithms: Theory and experimental evaluation, An approach for the network flow problem with multiple objectives, Rough sets and matroids from a lattice-theoretic viewpoint, Maximum cycle-means of weighted digraphs, A linear time algorithm for maximum matchings in convex, bipartite graphs, A maximum $b$-matching problem arising from median location models with applications to the roommates problem, Revisiting $k$-sum optimization, Fractional 0-1 programming: applications and algorithms, Calculating some inverse linear programming problems, Preference profiles determining the proposals in the Gale-Shapley algorithm for stable matching problems, Min-cost multiflows in node-capacitated undirected networks, Gross substitutability: an algorithmic survey, A type of biased consensus-based distributed neural network for path planning, Two-path subsets: Efficient counting and applications to performability analysis, Minimum-cost flows in unit-capacity networks, New bounds for optimum traffic assignment in satellite communication., A computational study of solution approaches for the resource constrained elementary shortest path problem, Weighted inverse maximum perfect matching problems under the Hamming distance, Optimal path planning based on visibility, Optimising waiting at nodes in time-dependent networks: cost functions and applications, Fair-by-design matching, Generalized path-finding algorithms on semirings and the fuzzy shortest path problem., Algorithms and codes for dense assignment problems: The state of the art, Fast approximation of matroid packing and covering, Traffic equilibrium with a continuously distributed bound on travel weights: the rise of range anxiety and mental account, Shortest path network problems with stochastic arc weights, Approximation algorithms for some min-max postmen cover problems, A note on competing-agent Pareto-scheduling, On the notion of generalized minor in topological network theory and matroids, Approximating the minimum cycle mean, Parameterized complexity of the spanning tree congestion problem, Breakout local search for the Steiner tree problem with revenue, budget and hop constraints, A hybrid framework for over-constrained generalized resource-constrained project scheduling problems, Improved approximation algorithms for capacitated facility location problems, Improving solution times for stable matching problems through preprocessing, Representative families for matroid intersections, with applications to location, packing, and covering problems, Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion, A novel chaotic particle swarm optimization algorithm for parking space guidance, Complexity of packing common bases in matroids, Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem, A priority based assignment problem, A survey of network interdiction models and algorithms, A unifying model for locally constrained spanning tree problems, The minimum spanning tree problem on a planar graph, Using the generalized assignment problem in scheduling the ROSAT space telescope, Multiple bottleneck assignment problem, The multi-mode resource-constrained project scheduling problem with generalized precedence relations, Notes on polyhedra associated with hop-constrained paths, On patching algorithms for random asymmetric travelling salesman problems, Solving the linear matroid parity problem as a sequence of matroid intersection problems, A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem, Faster algorithms for quantitative verification in bounded treewidth graphs, Bicriteria scheduling of equal length jobs on uniform parallel machines, Triangulations intersect nicely, Generalized matroid matching, Pfaffian pairs and parities: counting on linear matroid intersection and parity problems, A multiparameter analysis of the boundedness problem for vector addition systems, On dual integrality in matching problems, A bidirectional shortest-path algorithm with good average-case behavior, Multi-constrained matroidal knapsack problems, Solving combinatorial problems with combined min-max-min-sum objective and applications, New lower bounds for the symmetric travelling salesman problem, A module-theoretic approach to matroids, On some matching problems under the color-spanning model, Inverse problems of submodular functions on digraphs, Degenerate optimal basis graphs in linear programming, Connectivity and edge-disjoint spanning trees, Algorithm for the solution of the assignment problem for sparse matrices, Output sensitive fault tolerant maximum matching, Machine scheduling with a rate-modifying activity, The symmetry number problem for trees, Computing Euclidean bottleneck matchings in higher dimensions, An alternate approach to solve two-level priority based assignment problem, The maximum ratio clique problem, Canceling most helpful total cuts for minimum cost network flow, On Eigenproblem for Circulant Matrices in Max-Algebra, Greedy Families for Linear Objective Functions, Reliability covering problems, The most vital edges of matching in a bipartite graph, Computing rooted communication reliability in an almost acyclic digraph, Recent developments in maximum flow algorithms, Generating sparse 2—spanners, Computing proximity drawings of trees in the 3-dimensional space, An improved direct labeling method for the max-flow min-cut computation in large hypergraphs and applications, Minimum flows in (s,t) planar networks, Spirality of orthogonal representations and optimal drawings of series-parallel graphs and 3-planar graphs (extended abstract), Minimum weight euclidean matching and weighted relative neighborhood graphs, Coloration de graphes : fondements et applications, On Fault-Tolerant Low-Diameter Clusters in Graphs, Understanding retiming through maximum average-delay cycles, Alternating Basis Exchanges in Matroids, Admissible representations for probability measures, THE MAXIMUM WEIGHT PERFECT MATCHING PROBLEM FOR COMPLETE WEIGHTED GRAPHS IS IN PC∗†, Computing Weighted Strength and Applications to Partitioning, Unnamed Item, Design of Survivable Networks: A survey, Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains, Toward an Automatic Approach to Greedy Algorithms, Algorithms for single-machine scheduling with stochastic outtree precedence relations to minimize expected weighted flow time or maximum expected lateness, A Randomly Weighted Minimum Arborescence with a Random Cost Constraint, Independent edges in bipartite graphs obtained from orientations of graphs, Computation of the forwarding index via flows: A note, Maximum likelihood genetic sequence reconstruction from oligo content, Revised Greedy algorithm for formation of a minimal cycle basis of a graph, Directed star decompositions of the complete directed graph, A spanning tree heuristic for regional clustering, Approximation algorithms for Min-k-overlap problems using the principal lattice of partitions approach, The Maximum Ratio Clique Problem: A Continuous Optimization Approach and Some New Results, Unnamed Item, Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries, A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs, EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS, Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm, ON INFORMATION-PRESERVING TRANSFORMATIONS, Fractional programming, A Weighted Linear Matroid Parity Algorithm, CHAIN STRUCTURES IN SCHEDULES TASKS, MUTUALLY-RECURSIVE FORMULAS FOR ENUMERATING PARTITIONS OF THE RECTANGLE, Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Corrected Version), VALUES FOR GAMES ON THE CYCLES OF A DIGRAPH, A functional equation for finding the largest expected capacity of a graph, An algorithm for the resource constrained shortest path problem, Exact cuts in networks, Approximation algorithms for finding low-degree subgraphs, Simulated annealing: An introduction, On the difficulty of finding walks of length k, Optimal enclosing regions in planar graphs, A branch‐and‐bound algorithm for scheduling of new product development projects, Admissible Representations of Probability Measures, Shortest path algorithms using dynamic breadth‐first search, On general routing problems, Minimal ratio spanning trees, Predicting deadlock in store‐and‐forward networks, Graphs with the Circuit Cover Property, Maximizing project cash availability, On matroids and hierarchical graphs, Sufficient conditions for the unique solvability of linear networks containing memoryless 2-ports, Unnamed Item, Algorithms for source-to-all maximum cost-to-time ratio problem in acyclic networks, Thek best spanning arborescences of a network, Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem, An algorithm to solve them ×n assignment problem in expected timeO(mn logn), Minimizing the cost of placing and sizing wavelength division multiplexing and optical crossconnect equipment in a telecommunications network, GENERALIZED GEOMETRIC APPROACHES FOR LEAF SEQUENCING PROBLEMS IN RADIATION THERAPY, Optimal project compression with due-dated events, Use of matroid theory in operations research, circuits and systems theory, A polynomially bounded algorithm for a singly constrained quadratic program, Scheduling jobs with piecewise linear decreasing processing times, Structural questions with GERT-networks, Generalizations of Hoffman's existence theorem for circulations, A new algorithm for the assignment problem, Counting Perfect Matchings and the Switch Chain, A bidirected generalization of network matrices, Unnamed Item, Bimatroidal independence systems, Probabilistic analysis of an lp relaxation bound for the steiner problem in networks, Optimum matching forests I: Special weights, Integral decomposition in polyhedra, An Algorithm for Partitioning the Nodes of a Graph, Parametric approaches to fractional programs, The flow circulation sharing problem, The generalized diameter of a graph, Fully Dynamic Maximal Matching in $O(\log n)$ Update Time, Minimum cost flow with set-constraints, The Bounded Path Tree Problem, Algorithms for Weighted Matching Generalizations II: f-factors and the Special Case of Shortest Paths, Optimal sharing, Unnamed Item, A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory, Optimally fast shortest path algorithms for some classes of graphs, Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems, A comprehensive simplex-like algorithm for network optimization and perturbation analysis, A greedy algorithm for dropping digits, Network Flow-Based Refinement for Multilevel Hypergraph Partitioning, Blocking trails for $f$-factors of multigraphs, A weight-scaling algorithm for $f$-factors of multigraphs, Feedback vertex set reconfiguration in planar graphs, Optimal hierarchical clustering on a graph, Optimal general factor problem and jump system intersection, Probabilistic analysis of optimization problems on sparse random shortest path metrics, Maximum skew-symmetric flows, The online transportation problem, Mathematical aspects of the Digital Annealer's simulated annealing algorithm, Matroid Intersection under Restricted Oracles, A local search approximation algorithm for the multiway cut problem, Improving a constructive heuristic for the general routing problem, Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids, Steiner problems on directed acyclic graphs, Approximating minimum weight perfect matchings for complete graphs satisfying the triangle inequality, Unnamed Item, Perfect matchings in hexagonal systems, On a classification of independence systems, On a classification of independence systems, The complexity of linear programming, Robust partial inverse network flow problems, Online facility assignment, Improved approximation algorithms for minimum power covering problems, The complexity of bottleneck labeled graph problems, Relaxing the irrevocability requirement for online graph algorithms, Distributed MST for constant diameter graphs, Eulerian Orientations and Circulations, A time expanded matroid algorithm for finding optimal dynamic matroid intersections, Efficient dual simplex algorithms for the assignment problem, Steiner trees, connected domination and strongly chordal graphs, A minimum concave-cost dynamic network flow problem with an application to lot-sizing, Solving matching problems with linear programming, Shortest‐path methods: Complexity, interrelations and new propositions, Blossom-Quad: A non-uniform quadrilateral mesh generator using a minimum-cost perfect-matching algorithm, Synthesis of directed multicommodity flow networks, Recognizing binet matrices, An Extension of the Brouwer-Zimmermann Minimum Weight Algorithm, Monotonicity of the core and value in dynamic cooperative games, Scaling: A general framework, A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithm, A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data, Linear-Time Approximation for Maximum Weight Matching, k-Best constrained bases of a matroid, Minimizing the number of grab's changes in a single machine scheduling problem, Strict matching matroids and matroid algorithms, Computing the generic jordan canonical form, Scheduling identical jobs on uniform parallel machines, Worst-case greedy matchings in the unitd-cube, The Null Space Problem I. Complexity, Invited paper Data rate optimization in synchronous circuits, The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable, Finding connected $k$-subgraphs with high density, Algorithms for the Maximum Weight Connected $$k$$-Induced Subgraph Problem, Finding Connected Dense $$k$$-Subgraphs, Polyhedral Combinatorics in Combinatorial Optimization, A particular timetable problem: terminal scheduling, A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM, Counting almost minimum cutsets with reliability applications, Hamiltonian circuits with generalised cost, Two algorithms for weighted matroid intersection, A note on a two-agent scheduling problem related to the total weighted late work, The Complexity of Bottleneck Labeled Graph Problems, On the complexity of packing rainbow spanning trees, Computing a Sparse Basis for the Null Space, LP extreme points and cuts for the fixed-charge network design problem, Topological conditions for the unique solvability of linear time-invariant and time-varying networks, Fuzzy graphs modelling for hazmat telegeomonitoring, Minimizing total tardiness on parallel machines with preemptions, Algorithms for maximumk-colorings andk-coverings of transitive graphs, The Null Space Problem II. Algorithms, On the Location and p-Median Polytopes, Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover, Improving reliability bounds in computer networks, Combination algorithms for Steiner tree variants, Mixing time and simulated annealing for the stochastic cellular automata, The robustness of interval matrices in max-plus algebra, How many attackers can selfish defenders catch?, Polymatroidal flow network models with multiple sinks, A new?old algorithm for minimum-cut and maximum-flow in closure graphs, A New Formulation for the Travelling Salesman Problem, A dual ascent approach for steiner tree problems on a directed graph, ASSIGNMENT QUERY AND ITS IMPLEMENTATION IN MOVING OBJECT DATABASES, Stochastisches PERT — Eine vergleichende Untersuchung über die Effizienz eines Verfahrens zur stochastischen Projektplanung, Crown reductions for the minimum weighted vertex cover problem, Computing an eigenvector of a Monge matrix in max-plus algebra, Efficient computation of shortest paths in networks using particle swarm optimization and noising metaheuristics, Some further results on minimum distribution cost flow problems, Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints, Finding thet-join structure of graphs, A quick method for finding shortest pairs of disjoint paths, Discrete optimization methods for multiprocessor computer systems, Lower planes for the network design problem, Product line selection and pricing analysis: impact of genetic relaxations, Computational complexity of isothermic DNA sequencing by hybridization, A new algorithm for the discrete fuzzy shortest path problem in a network, Dynamic matchings and quasidynamic fractional matchings. I, Dynamic matchings and quasidynamic fractional matchings. II, On multicommodity flows in planar graphs, Network reliability and acyclic orientations, Unlabelled Partition Systems: Optimization and Complexity, Using structured steiner trees for hierarchical global routing, On the characterization of the domination of a diameter-constrained network reliability model, Persistence in discrete optimization under data uncertainty, Information tradeoffs in model building: A network routing application, Complexity Results for the Spanning Tree Congestion Problem, Optimal routing and process scheduling for a mobile service facility, On the computational complexity of combinatorial flexibility problems, Algebraic Algorithms for Linear Matroid Parity Problems, Min-Max partitioning problem with matroid constraint, Tropical Arithmetic and Matrix Algebra, Some aspects on solving transportation problem, The Stable Fixtures Problem with Payments, A Bayesian Approach to Simulated Annealing, The approximability of the weighted Hamiltonian path completion problem on a tree, Maximum-throughput dynamic network flows, MINIMIZING TOTAL WEIGHTED COMPLETION TIME ON IDENTICAL PARALLEL BATCH MACHINES, Distributed asynchronous computation of fixed points, The traveling salesman problem: An update of research, Unnamed Item, A unified framework for primal-dual methods in minimum cost network flow problems, Calculating bounds on reachability and connectedness in stochastic networks, A decomposition algorithm for linear relaxation of the weightedr-covering problem, Dealing with degeneracy in reduced gradient algorithms, Computing optimal scalings by parametric network algorithms, Roof duality, complementation and persistency in quadratic 0–1 optimization, The duality theorem of linear programming: an intuitive approach