The following pages link to (Q3998396):
Displaying 50 items.
- Dual cone approach to convex-cone dominance in multiple criteria decision making (Q321121) (← links)
- Applied cost allocation: the DEA-Aumann-Shapley approach (Q323398) (← links)
- Solving fully fuzzy matrix equations (Q345498) (← links)
- Ratio-based RTS determination in weight-restricted DEA models (Q421681) (← links)
- A capable neural network model for solving the maximum flow problem (Q425347) (← links)
- Linear bilevel programming with interval coefficients (Q432810) (← links)
- An enumerative algorithm for computing all possibly optimal solutions to an interval LP (Q456920) (← links)
- Artificial-free simplex algorithm based on the non-acute constraint relaxation (Q470802) (← links)
- Processing time-dependent shortest path queries without pre-computed speed information on road networks (Q497898) (← links)
- A specialized network simplex algorithm for the constrained maximum flow problem (Q531424) (← links)
- Inverse problems and solution methods for a class of nonlinear complementarity problems (Q540647) (← links)
- Cost efficiency with triangular fuzzy number input prices: an application of DEA (Q603770) (← links)
- A heuristic method for the minimum toll booth problem (Q604959) (← links)
- Exact decomposition approaches for Markov decision processes: a survey (Q606196) (← links)
- Finding weak defining hyperplanes of PPS of the BCC model (Q611575) (← links)
- Sensitivity analysis on the priority of the objective functions in lexicographic multiple objective linear programs (Q613426) (← links)
- An introduction to dynamic generative networks: minimum cost flow (Q651703) (← links)
- Load capacity ratios for structures (Q658709) (← links)
- Accelerated multigrid for graph Laplacian operators (Q670780) (← links)
- A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses (Q699349) (← links)
- On FDH efficiency analysis with interval data (Q702576) (← links)
- The sagitta method for solving linear programs (Q703904) (← links)
- An efficient Lagrangean heuristic for rental vehicle scheduling (Q709131) (← links)
- An extended shortest path problem: a data envelopment analysis approach (Q712615) (← links)
- Extending linear relaxation for non-square matrices and soft constraints (Q738985) (← links)
- Computation of the collapse state in limit analysis using the LP primal affine scaling algorithm (Q750203) (← links)
- An efficient neural network for solving convex optimization problems with a nonlinear complementarity problem function (Q781395) (← links)
- A simplex approach for finding local solutions of a linear bilevel program by equilibrium points (Q817135) (← links)
- Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle (Q828730) (← links)
- On the structural properties of a discrete-time single product revenue management problem (Q833601) (← links)
- Generalized minimal cost flow problem in fuzzy nature: an application in bus network planning problem (Q838183) (← links)
- Fuzzy goal programming: complementary slackness conditions and computational schemes (Q849750) (← links)
- Duality in fuzzy number linear programming by use of a certain linear ranking function (Q850252) (← links)
- A dual-based algorithm for solving lexicographic multiple objective programs (Q853009) (← links)
- Computational and theoretical pitfalls in some current performance measurement techniques; and a new approach (Q856111) (← links)
- Optimality and bias of some interpolation and extrapolation designs (Q866632) (← links)
- A polynomial-time algorithm to estimate returns to scale in FDH models (Q868156) (← links)
- Continuous modular design problem: analysis and solution algorithms (Q868591) (← links)
- Reliable overlay multicast trees for private internet broadcasting with multiple sessions (Q875431) (← links)
- A super-efficiency model for ranking efficient units in data envelopment analysis (Q879528) (← links)
- Computational evaluation of multi-iterative approaches for solving graph-structured large linear systems (Q895654) (← links)
- Distance functions for matching in small samples (Q901583) (← links)
- A geometric approach for solving fuzzy linear programming problems (Q934693) (← links)
- Cost allocation and convex data envelopment (Q958592) (← links)
- An effective computational attempt in DDEA (Q965552) (← links)
- A travel demand management strategy: the downtown space reservation system (Q976360) (← links)
- Maximum flow problem on dynamic generative network flows with time-varying bounds (Q988972) (← links)
- Improved immune algorithm for global numerical optimization and job-shop scheduling problems (Q990689) (← links)
- A dual simplex-based method for determination of the right and left returns to scale in DEA (Q1002069) (← links)
- A decomposition approach for the probabilistic maximal covering location-allocation problem (Q1017444) (← links)
