Computational efficiency and interactive MOLP algorithms: An implementation of the SIMOLP procedure
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3950233 (Why is no real title available?)
- scientific article; zbMATH DE number 3709925 (Why is no real title available?)
- scientific article; zbMATH DE number 3895002 (Why is no real title available?)
- A simplified interactive multiple objective linear programming procedure
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions
- Approximate Traveling Salesman Algorithms
- Generalized theorems for permanent basic and nonbasic variables
- Goal programming and multiple objective optimizations. Part I
- Implementation of successive linear programming algorithms for non-convex goal programming
- Interactive Goal Programming
- Linear programming with multiple objective functions: Step method (stem)
- On generation of test problems for linear programming codes
- Successive linear programming for ratio goal problems
Cited in
(7)- scientific article; zbMATH DE number 3889259 (Why is no real title available?)
- MOLP with an interactive assessment of a piecewise linear utility function
- An interactive MOLP procedure using epsilon-constraints
- A comparative study of interactive tradeoff cutting plane methods for MOMP
- Comparative studies in interactive multiple objective mathematical programming
- A simplified MOLP algorithm: The MOLP-S procedure
- Group decision processes: MOLP procedures facilitating group and individual decision orientations
This page was built for publication: Computational efficiency and interactive MOLP algorithms: An implementation of the SIMOLP procedure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1825145)