Pages that link to "Item:Q869154"
From MaRDI portal
The following pages link to A review of interactive methods for multiobjective integer and mixed-integer programming (Q869154):
Displayed 36 items.
- Towards a multi-objective performance assessment and optimization model of a two-echelon supply chain using SCOR metrics (Q301311) (← links)
- Biobjective robust optimization over the efficient set for Pareto set reduction (Q322934) (← links)
- A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods (Q331779) (← links)
- An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems (Q339623) (← links)
- ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design (Q342390) (← links)
- An interactive algorithm to find the most preferred solution of multi-objective integer programs (Q342783) (← links)
- Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem (Q625647) (← links)
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms (Q1043327) (← links)
- An interactive algorithm for multiple criteria constrained sorting problem (Q1615969) (← links)
- An interactive approximation algorithm for multi-objective integer programs (Q1652656) (← links)
- Computing multiobjective Markov chains handled by the extraproximal method (Q1730553) (← links)
- Fathoming rules for biobjective mixed integer linear programs: review and extensions (Q1751199) (← links)
- Disruption management in vehicle routing and scheduling for road freight transport: a review (Q1752346) (← links)
- A bi-objective modeling approach applied to an urban semi-desirable facility location problem (Q1927006) (← links)
- Multiobjective integer nonlinear fractional programming problem: a cutting plane approach (Q1937858) (← links)
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems (Q2016277) (← links)
- New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach (Q2106743) (← links)
- Scalarizing fuzzy multi-objective linear fractional programming with application (Q2115090) (← links)
- Solution approaches for equitable multiobjective integer programming problems (Q2150765) (← links)
- Fair resource allocation: using welfare-based dominance constraints (Q2242256) (← links)
- A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems (Q2256164) (← links)
- Bi-objective short-term scheduling in a rolling horizon framework: a priori approaches with alternative operational objectives (Q2273666) (← links)
- GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs (Q2327904) (← links)
- Cone contraction and reference point methods for multi-criteria mixed integer optimization (Q2355896) (← links)
- An algorithm for optimizing a linear function over an integer efficient set (Q2378378) (← links)
- Solution of preemptive multi-objective network design problems applying Benders decomposition method (Q2442088) (← links)
- A decomposition based minimax regret approach for inverse multiple criteria sorting problem (Q2688883) (← links)
- A Method for Generating a Well-Distributed Pareto Set in Multiple Objective Mixed Integer Linear Programs Based on the Decision Maker’s Initial Aspiration Level (Q2821098) (← links)
- Multi-objective due-date setting in a make-to-order environment (Q3055252) (← links)
- Monolithic versus hierarchical approach to integrated scheduling in a supply chain (Q3055263) (← links)
- An algorithm for multiparametric 0-1-Integer Programming problems relative to a generalized min max objective function (Q3621972) (← links)
- Solving the Multiple Objective Integer Linear Programming Problem (Q3627676) (← links)
- An interactive algorithm for deciding multi‐criteria weights in incomplete information environment (Q4932877) (← links)
- An interactive possibilistic programming approach for a multi-objective closed-loop supply chain network under uncertainty (Q5172559) (← links)
- (Q5860583) (← links)
- A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising (Q6069770) (← links)