The following pages link to (Q3649086):
Displaying 50 items.
- Minimax regret solution to multiobjective linear programming problems with interval objective functions coefficients (Q301052) (← links)
- Fuzzy linear programming approach for solving transportation problems with interval-valued trapezoidal fuzzy numbers (Q332772) (← links)
- Mathematical models and algorithms for a high school timetabling problem (Q337589) (← links)
- A generalized coupon collecting model as a parsimonious optimal stochastic assignment model (Q378733) (← links)
- Alternative solutions for classifying inputs and outputs in data envelopment analysis (Q453835) (← links)
- Inverse linear programming with interval coefficients (Q495129) (← links)
- A metaheuristic for a numerical approximation to the mass transfer problem (Q511366) (← links)
- A robust optimization approach for multicast network coding under uncertain link costs (Q526429) (← links)
- Parametric aggregation in ordered weighted averaging (Q648359) (← links)
- A new study on some Vandermonde matrices and systems (Q827349) (← links)
- The problem of efficient network operation (Q880775) (← links)
- Foundations of network optimization and games (Q889409) (← links)
- Control the fibre orientation distribution at the outlet of contraction (Q1028011) (← links)
- A novel method for solving linear programming problems with symmetric trapezoidal fuzzy numbers (Q1632951) (← links)
- An approximation scheme for the Kantorovich-Rubinstein problem on compact spaces (Q1649476) (← links)
- Estimation of hierarchical Archimedean copulas as a shortest path problem (Q1668652) (← links)
- Algebraic and dynamical cancellations associated to spectral sequence (Q1677186) (← links)
- Approximate dynamic programming for lateral transshipment problems in multi-location inventory systems (Q1681324) (← links)
- The use of quasi-concave value functions in MCDM: some theoretical results (Q1683943) (← links)
- Solving the moving target search problem using indistinguishable searchers (Q1711443) (← links)
- A novel neural network for solving semidefinite programming problems with some applications (Q1713177) (← links)
- Conditions under which adjustability lowers the cost of a robust linear program (Q1730447) (← links)
- Computing the minimum construction cost of a building's external wall taking into account its energy efficiency (Q1743957) (← links)
- Integrated data envelopment analysis: linear vs. nonlinear model (Q1754321) (← links)
- Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem (Q1761969) (← links)
- On a fractional minimal cost flow problem on networks (Q1926638) (← links)
- A tree traversal algorithm for decision problems in knot theory and 3-manifold topology (Q1949747) (← links)
- Selecting most efficient information system projects in presence of user subjective opinions: a DEA approach (Q1989804) (← links)
- A new algorithm to solve fully fuzzy linear programming problems using the MOLP problem (Q2009668) (← links)
- New data envelopment analysis models for classifying flexible measures: the role of non-Archimedean epsilon (Q2030478) (← links)
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming (Q2162530) (← links)
- A novel approach to subgraph selection with multiple weights on arcs (Q2168723) (← links)
- An interval efficiency analysis with dual-role factors (Q2241998) (← links)
- A column generation mathematical programming approach for a class-faculty assignment problem with preferences (Q2355201) (← links)
- Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time (Q2364490) (← links)
- A novel method for selecting a single efficient unit in data envelopment analysis without explicit inputs/outputs (Q2399344) (← links)
- Inverse optimization for multi-objective linear programming (Q2414110) (← links)
- On generating maximal nondominated Benders cuts (Q2442075) (← links)
- Optimization model applied to radiotherapy planning problem with dose intensity and beam choice (Q2660085) (← links)
- An accelerated Benders decomposition algorithm for solving a double-type double-standard maximal covering location problem (Q2661956) (← links)
- Improved Bounds on the Phase Transition for the Hard-Core Model in 2-Dimensions (Q2851895) (← links)
- Linear programming and algorithms for communication networks. A practical guide to network design, control and management (Q2915363) (← links)
- Immersed NURBS for CFD Applications (Q2948918) (← links)
- Solving a tri-criteria best path problem using the fuzzy decision making (Q2988626) (← links)
- Passive Decoy State Quantum Key Distribution (Q3064331) (← links)
- (Q3160276) (← links)
- An efficient metaheuristic for integrated scheduling and staffing IT projects based on a generalized minimum cost flow network (Q3166685) (← links)
- (Q3303478) (← links)
- (Q3584085) (← links)
- (Q4047384) (← links)
