scientific article; zbMATH DE number 53116
From MaRDI portal
Publication:4003376
Recommendations
Cited in
(75)- A decentralized coordination mechanism for integrated production-transportation-inventory problem in the supply chain using Lagrangian relaxation
- Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function
- Distribution network optimization: Finding the most economic solution by using genetic algorithms
- A generic auction algorithm for the minimum cost network flow problem
- Parallel primal-dual methods for the minimum cost flow problem
- Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking
- A computational analysis of the auction algorithm
- Efficient parallel algorithms for the minimum cost flow problem
- A case study in empty railcar distribution
- The doubly graded matrix cone and Ferrers matrices
- Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints.
- Heuristic and exact algorithms for the simultaneous assignment problem
- Auction dynamics: a volume constrained MBO scheme
- Experimental evaluation of solution approaches for the \(K\)-route maximum flow problem
- A forward/reverse auction algorithm for asymmetric assignment problems
- Polynomial auction algorithms for shortest paths
- Solving the multiple competitive facilities location problem
- Robust scheduling of metaprograms
- Single machine scheduling with symmetric earliness and tardiness penalties
- A heuristic for the continuous capacity and flow assignment
- A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
- Representation and management of MOEA populations based on graphs
- An auction algorithm for the max-flow problem
- Multimodal transport network systems interface, interaction coordination: A specification for control systems integration
- Parallel asynchronous label-correcting methods for shortest paths
- An efficient cost scaling algorithm for the assignment problem
- An approach for the network flow problem with multiple objectives
- Infinite networks: Minimal cost flows
- Algorithms and codes for dense assignment problems: The state of the art
- Constrained balanced optimization problems
- Parallel asynchronous algorithms for the K shortest paths problem
- Stochastic downscaling method: application to wind refinement
- Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs
- Distribution and quantile functions, ranks and signs in dimension \(d\): a measure transportation approach
- Regular random choice and the triangle inequalities
- Rank-based testing for semiparametric VAR models: a measure transportation approach
- The assignment problem revisited
- An auction-based approach for the re-optimization shortest path tree problem
- Solving the shortest path tour problem
- Algorithms for time-dependent bicriteria shortest path problems
- Network flows. Theory, algorithms, and applications.
- Robust auctions for revenue via enhanced competition
- Parametrization of Random Vectors in Polynomial Chaos Expansions via Optimal Transportation
- Fast convergence in the double oral auction
- Transfer Graph Approach for Multimodal Transport Problems
- scientific article; zbMATH DE number 5641435 (Why is no real title available?)
- A linear programming approach to the optimum network orientation problem
- scientific article; zbMATH DE number 4070603 (Why is no real title available?)
- scientific article; zbMATH DE number 41051 (Why is no real title available?)
- Nodal interdiction
- A multiplier adjustment technique for the capacitated concentrator location problem
- A simple and fast label correcting algorithm for shortest paths
- Maximum likelihood genetic sequence reconstruction from oligo content
- The out‐of‐kilter algorithm for solving network problems
- An -relaxation method for generalized separable convex cost network flow problems
- THE ASSIGNMENT OF INDIVIDUAL RENEWABLE RESOURCES IN SCHEDULING
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis
- scientific article; zbMATH DE number 1444279 (Why is no real title available?)
- Shortest path reoptimization vs resolution from scratch: a computational comparison
- scientific article; zbMATH DE number 3894862 (Why is no real title available?)
- Mathematical programs with equilibrium constraints: A brief survey of methods and optimality conditions
- The vehicle rescheduling problem: Model and algorithms
- A simplification of the double-sweep algorithm to solve the \(k\)-shortest path problem
- A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods
- Matching One Sample According to Two Criteria in Observational Studies
- Wasserstein distances in the analysis of time series and dynamical systems
- Branch-and-price based heuristic algorithm for fuzzy multi-depot bus scheduling problem
- Robust maximum flow network interdiction considering uncertainties in arc capacity and resource consumption
- Projection methods for finding the greatest element of the intersection of max-closed convex sets
- Nonsmooth projection-free optimization with functional constraints
- A conservative constrained clustering-merging algorithm for particle-in-cell codes
- Tightening Blocks in Complementary Analyses of Observational Studies: Optimization Algorithm and Examples
- Code generation for solving and differentiating through convex optimization problems
- Dimitri P. Bertsekas (1942--2026): in memoriam
- Towards auction algorithms for large dense assignment problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4003376)
