The following pages link to (Q4003376):
Displaying 50 items.
- Nodal interdiction (Q410061) (← links)
- Wasserstein distances in the analysis of time series and dynamical systems (Q617532) (← links)
- Towards auction algorithms for large dense assignment problems (Q839685) (← links)
- A decentralized coordination mechanism for integrated production-transportation-inventory problem in the supply chain using Lagrangian relaxation (Q1001384) (← links)
- Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function (Q1280137) (← links)
- Distribution network optimization: Finding the most economic solution by using genetic algorithms (Q1296786) (← links)
- A generic auction algorithm for the minimum cost network flow problem (Q1315446) (← links)
- Parallel primal-dual methods for the minimum cost flow problem (Q1315451) (← links)
- Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking (Q1318276) (← links)
- A computational analysis of the auction algorithm (Q1330563) (← links)
- Efficient parallel algorithms for the minimum cost flow problem (Q1379929) (← links)
- A case study in empty railcar distribution (Q1390331) (← links)
- The doubly graded matrix cone and Ferrers matrices (Q1399239) (← links)
- Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints. (Q1413824) (← links)
- Heuristic and exact algorithms for the simultaneous assignment problem (Q1572972) (← links)
- Auction dynamics: a volume constrained MBO scheme (Q1700735) (← links)
- Experimental evaluation of solution approaches for the \(K\)-route maximum flow problem (Q1772874) (← links)
- A forward/reverse auction algorithm for asymmetric assignment problems (Q1803649) (← links)
- Polynomial auction algorithms for shortest paths (Q1804574) (← links)
- Solving the multiple competitive facilities location problem (Q1847246) (← links)
- Robust scheduling of metaprograms (Q1850712) (← links)
- Single machine scheduling with symmetric earliness and tardiness penalties (Q1869413) (← links)
- A heuristic for the continuous capacity and flow assignment (Q1869661) (← links)
- A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem (Q1870831) (← links)
- Representation and management of MOEA populations based on graphs (Q1876158) (← links)
- An auction algorithm for the max-flow problem (Q1906750) (← links)
- Multimodal transport network systems interface, interaction coordination: A specification for control systems integration (Q1906983) (← links)
- Parallel asynchronous label-correcting methods for shortest paths (Q1908632) (← links)
- An efficient cost scaling algorithm for the assignment problem (Q1914072) (← links)
- An approach for the network flow problem with multiple objectives (Q1919979) (← links)
- Infinite networks: Minimal cost flows (Q1921147) (← links)
- Algorithms and codes for dense assignment problems: The state of the art (Q1962018) (← links)
- Constrained balanced optimization problems (Q1963024) (← links)
- Parallel asynchronous algorithms for the \(K\) shortest paths problem (Q1973483) (← links)
- Stochastic downscaling method: application to wind refinement (Q2001956) (← links)
- Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs (Q2020606) (← links)
- Distribution and quantile functions, ranks and signs in dimension \(d\): a measure transportation approach (Q2039808) (← links)
- Regular random choice and the triangle inequalities (Q2087563) (← links)
- Rank-based testing for semiparametric VAR models: a measure transportation approach (Q2108478) (← links)
- The assignment problem revisited (Q2136890) (← links)
- An auction-based approach for the re-optimization shortest path tree problem (Q2282822) (← links)
- Solving the shortest path tour problem (Q2356016) (← links)
- Algorithms for time-dependent bicriteria shortest path problems (Q2465939) (← links)
- Robust Auctions for Revenue via Enhanced Competition (Q3387955) (← links)
- Parametrization of Random Vectors in Polynomial Chaos Expansions via Optimal Transportation (Q3452487) (← links)
- Fast Convergence in the Double Oral Auction (Q3460777) (← links)
- Transfer Graph Approach for Multimodal Transport Problems (Q3627751) (← links)
- (Q3649086) (← links)
- A multiplier adjustment technique for the capacitated concentrator location problem (Q4227929) (← links)
- A simple and fast label correcting algorithm for shortest paths (Q4291478) (← links)
