The following pages link to Top (Q188728):
Displaying 50 items.
- Sensitivity analysis in a class of dynamic optimization models (Q1265248) (← links)
- Searching for a strong double tracing in a graph (Q1265251) (← links)
- Some new results on least square values for TU games (Q1265253) (← links)
- Special issue on Locational analysis (Q1284594) (← links)
- Location of rectilinear center trajectories (Q1284595) (← links)
- Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints (Q1284596) (← links)
- A convergent approximation scheme for efficient sets of the multi-criteria Weber location problem (Q1284597) (← links)
- Efficient solution methods for covering tree problems (Q1284598) (← links)
- Location of paths on trees with minimal eccentricity and superior section (Q1284599) (← links)
- Discretization results for the Huff and Pareto-Huff competitive location models on networks (Q1284600) (← links)
- The many-to-many location-routing problem (Q1284602) (← links)
- Solving the plant location problem on a line by linear programming (Q1284603) (← links)
- A methodology for modelling travel distances by bias estimation (Q1284604) (← links)
- Maximin location: Discretization not always works (Q1284606) (← links)
- Analytical solution for a class of learning by doing models with multiplicative uncertainty (Q1304768) (← links)
- Note on an improved branch-and-bound algorithm to solve \(n/m/P/F_{\text{max}}\) problems (Q1304770) (← links)
- Extensions of Dinkelbach's algorithm for solving nonlinear fractional programming problems (Q1304774) (← links)
- An algorithm for computing the stable coalition structures in tree-graph communication games (Q1304775) (← links)
- A generalized Malmquist productivity index (Q1304776) (← links)
- Locally Farkas-Minkowski linear inequality systems (Q1304777) (← links)
- The stochastic bottleneck linear programming problem (Q1304778) (← links)
- On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0-1 knapsack constraint (Q1304779) (← links)
- On surrogating 0-1 knapsack constraints (Q1304781) (← links)
- On the consistency of the Banzhaf semivalue (Q1304782) (← links)
- Operations research games: A survey. (With comments and rejoinder) (Q1348703) (← links)
- On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre (Q1348705) (← links)
- List scheduling algorithms to minimize the makespan on identical parallel machines (Q1348708) (← links)
- Location and sizing of facilities on a line (Q1348709) (← links)
- On the coherence function for stochastic systems (Q1348711) (← links)
- The Lagrange approach to infinite linear programs (Q1348714) (← links)
- A survey of some mathematical programming models in transportation (Q1367685) (← links)
- Solving large set covering problems for crew scheduling (Q1367686) (← links)
- A few practical problems on the application of OD-estimation in motorway networks (Q1367688) (← links)
- Traffic queue estimation (Q1367692) (← links)
- Assessing the efficiency of rapid transit configurations (Q1367693) (← links)
- The two-convex-polygons TSP: A solvable case (Q1367695) (← links)
- Asymptotic behavior of continuous stochastic games (Q1367870) (← links)
- Some properties of cliques in 0-1 mixed integer programs (Q1367871) (← links)
- A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale network (Q1367872) (← links)
- A prekernel characterization by means of stability properties (Q1367874) (← links)
- An improvement and an extension of the Elzinga \& Hearn's algorithm to the 1-center problem in \(\mathbb{R}^ n\) with \(l_{2b}\)-norms (Q1367876) (← links)
- Utility efficiency and its approximation (Q1367878) (← links)
- Optimal purchase and advertising for a product with immediate sale start (Q1367880) (← links)
- Variability reduction with multiweighting proceedings (Q1367881) (← links)
- Optimal use of hub facilities: A two-hub model with fixed arc costs (Q1367882) (← links)
- Approximate algorithms for the \(P\parallel C_{\max}\) problem (Q1367883) (← links)
- A model for strategic planning under uncertainty (Q1367885) (← links)
- Linearity criterion for the selection of an optimal tree (Q1367936) (← links)
- On the optimal control of stochastic linear systems with contaminated partial observations (Q1367937) (← links)
- On due-date based valid cuts for the sequential ordering problem (Q1367938) (← links)
