scientific article; zbMATH DE number 1239298
From MaRDI portal
Publication:4225395
zbMath0997.90505MaRDI QIDQ4225395
Publication date: 13 January 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (89)
Discrete geodesic graph (DGG) for computing geodesic distances on polyhedral surfaces ⋮ An efficient metaheuristic to improve accessibility by rural road network planning ⋮ A heuristic approach to project staffing ⋮ Variable demand and multi-commodity flow in Markovian network equilibrium ⋮ Constrained flow control in storage networks: capacity maximization and balancing ⋮ Towards auction algorithms for large dense assignment problems ⋮ Polynomial-time identification of robust network flows under uncertain arc failures ⋮ An exact method for the biobjective shortest path problem for large-scale road networks ⋮ Quadratically Regularized Optimal Transport on Graphs ⋮ Stochastic and dynamic shipper carrier network design problem ⋮ Graded Matching for Large Observational Studies ⋮ Solving the median problem with continuous demand on a network ⋮ Multi-stage optimization for periodic inspection planning of geo-distributed infrastructure systems ⋮ The vehicle allocation problem: alternative formulation and branch-and-price method ⋮ On the solvability of closest point projection procedures in contact analysis: analysis and solution strategy for surfaces of arbitrary geometry ⋮ \(p\)-facility Huff location problem on networks ⋮ Segmentation and classification of high resolution imagery for mapping individual species in a closed canopy, deciduous forest ⋮ When optimal transport meets information geometry ⋮ A framework for and empirical study of algorithms for traffic assignment ⋮ Intelligent transportation systems -- Enabling technologies ⋮ A posteriorierror bounds for reduced-basis approximations of parametrized parabolic partial differential equations ⋮ Approximating Wardrop equilibria with finitely many agents ⋮ Cardinality of Upper Average and Its Application to Network Optimization ⋮ Optimisation of timetable-based, stochastic transit assignment models based on MSA ⋮ Optimal scaling of a gradient method for distributed resource allocation ⋮ Randomized Shortest-Path Problems: Two Related Models ⋮ An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem ⋮ Economic model predictive control for robust optimal operation of sparse storage networks ⋮ Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points ⋮ Optimal placement of UV-based communications relay nodes ⋮ Towards an optimization theory for deforming dense granular materials: minimum cost maximum flow solutions ⋮ A decomposition method for solving multicommodity network equilibria ⋮ Multiple machine continuous setup lotsizing with sequence-dependent setups ⋮ A distributed simplex algorithm for degenerate linear programs and multi-agent assignments ⋮ The risk of maternal complications after Cesarean delivery: near-far matching for instrumental variables study designs with large observational datasets ⋮ The boundary method for semi-discrete optimal transport partitions and Wasserstein distance computation ⋮ Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization ⋮ Duality in Countably Infinite Monotropic Programs ⋮ The relaxed inexact projection methods for the split feasibility problem ⋮ A graph space optimal transport distance as a generalization of L p distances: application to a seismic imaging inverse problem ⋮ Cooperative maximum-flow problem under uncertainty in logistic networks ⋮ Partially observable Markov decision model for the treatment of early prostate cancer ⋮ Auction dynamics: a volume constrained MBO scheme ⋮ Refined second law of thermodynamics for fast random processes ⋮ Efficient method of analyzing network branching ⋮ Solving the moving target search problem using indistinguishable searchers ⋮ A comparative study of two fast phase unwrapping algorithms. ⋮ Unnamed Item ⋮ Distributed optimization of P2P live streaming overlays ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ Matching methods for observational studies derived from large administrative databases ⋮ Comment: Matching methods for observational studies derived from large administrative databases ⋮ Rejoinder: Matching methods for observational studies derived from large administrative databases ⋮ Updating network flows given multiple, heterogeneous arc attribute changes ⋮ Duality for extended infinite monotropic optimization problems ⋮ Extended formulations for order polytopes through network flows ⋮ Single-facility huff location problems on networks ⋮ Optimization of transit route network, vehicle headways and timetables for large-scale transit networks ⋮ On integer balancing of directed graphs ⋮ Some assignment problems arising from multiple target tracking ⋮ An efficient model and algorithm for the transmission-constrained multi-site combined heat and power system ⋮ Coordinated road-network search route planning by a team of UAVs ⋮ An incremental subgradient method on Riemannian manifolds ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ A comparison of solution strategies for biobjective shortest path problems ⋮ Discrete and continuous models for partitioning problems ⋮ Convergent Lagrangian heuristics for nonlinear minimum cost network flows ⋮ A class of network optimization methods for planar grid generation ⋮ Dynamic programming approaches to solve the shortest path problem with forbidden paths ⋮ An implementation of Newton-like methods on nonlinearly constrained networks ⋮ Route planning for agent-based information retrieval ⋮ Linear programming interpretations of Mather's variational principle ⋮ Resource allocation for contingency planning: an inexact proximal bundle method for stochastic optimization ⋮ Ordered line integral methods for solving the eikonal equation ⋮ Numerical stability of path-based algorithms for traffic assignment ⋮ Extended monotropic programming and duality ⋮ Implementation and test of auction methods for solving generalized network flow problems with separable convex cost ⋮ A survey on metaheuristics for stochastic combinatorial optimization ⋮ Corner cases, singularities, and dynamic factoring ⋮ Sequential Quadratic Optimization for Nonlinear Equality Constrained Stochastic Optimization ⋮ Integrating Individual and Aggregate Diversity in Top-N Recommendation ⋮ Optimal Tradeoffs in Matched Designs Comparing US-Trained and Internationally Trained Surgeons ⋮ Models and algorithms for the screen line-based traffic-counting location problems ⋮ Robust shortest path planning and semicontractive dynamic programming ⋮ Modeling and mitigating supply chain disruptions as a bilevel network flow problem ⋮ Optimal Control with Budget Constraints and Resets ⋮ A review of the use of optimal transport distances for high resolution seismic imaging based on the full waveform ⋮ On the first-order estimation of multipliers from Kuhn-Tucker systems ⋮ Distributed primal-dual optimisation method with uncoordinated time-varying step-sizes
Uses Software
This page was built for publication:
