A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods
From MaRDI portal
Publication:331779
DOI10.1007/S00291-016-0434-2zbMATH Open1352.90053OpenAlexW2280426667MaRDI QIDQ331779FDOQ331779
Authors: Dinçer Konur, Hadi Farhangi, Cihan H. Dagli 
Publication date: 27 October 2016
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-016-0434-2
Recommendations
- Military system of systems architecting with individual system contracts
- Decomposition-based approaches for multiobjective composite systems
- Comparing problem formulations for coupled sets of components
- A goal-oriented modeling approach of system of systems
- Algebra of efficient sets for multiobjective complex systems
Management decision making, including multiple objectives (90B50) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11)
Cites Work
- Survey of multi-objective optimization methods for engineering
- Title not available (Why is that?)
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- A survey and annotated bibliography of multiobjective combinatorial optimization
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- An algorithm for the multiple objective integer linear programming problem
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems
- The \(L\)-shape search method for triobjective integer programming
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
- Finding all nondominated points of multi-objective integer programs
- Title not available (Why is that?)
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- Solving efficiently the 0-1 multi-objective knapsack problem
- A review of interactive methods for multiobjective integer and mixed-integer programming
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman problem
- The multi-objective generalized consistent vehicle routing problem
- Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming
- An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
- A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme
- Least-cost network topology design for a new service: An application of tabu search
- Military operations research. Quantitative decision making
- A tabu search algorithm for access network design
- Two new algorithms for UMTS access network topology design
- Adaptive parametric scalarizations in multicriteria optimization
- Large-Scale Network Topological Optimization
- Optimization of coupled systems - A critical overview of approaches
- Algebra of efficient sets for multiobjective complex systems
- Military system of systems architecting with individual system contracts
Cited In (2)
This page was built for publication: A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q331779)
