Pages that link to "Item:Q1042091"
From MaRDI portal
The following pages link to Multi-objective integer programming: a general approach for generating all non-dominated solutions (Q1042091):
Displaying 50 items.
- The \(L\)-shape search method for triobjective integer programming (Q298165) (← links)
- Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
- Towards a multi-objective performance assessment and optimization model of a two-echelon supply chain using SCOR metrics (Q301311) (← links)
- On the representation of the search region in multi-objective optimization (Q319674) (← links)
- A multi-criteria approach for hospital capacity analysis (Q323555) (← links)
- A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods (Q331779) (← links)
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case (Q339612) (← links)
- An exact algorithm for biobjective mixed integer linear programming problems (Q342401) (← links)
- Finding all nondominated points of multi-objective integer programs (Q377734) (← links)
- A mathematical programming approach to the computation of the omega invariant of a numerical semigroup (Q420862) (← links)
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations (Q724117) (← links)
- An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems (Q828841) (← links)
- SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems (Q828878) (← links)
- An interactive approximation algorithm for multi-objective integer programs (Q1652656) (← links)
- On nadir points of multiobjective integer programming problems (Q1683328) (← links)
- A new hybrid intelligent algorithm for fuzzy multiobjective programming problem based on credibility theory (Q1719365) (← links)
- Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems (Q1750397) (← links)
- Multiobjective integer nonlinear fractional programming problem: a cutting plane approach (Q1937858) (← links)
- Optimising a nonlinear utility function in multi-objective integer programming (Q1955541) (← links)
- Finding a representative nondominated set for multi-objective mixed integer programs (Q1991106) (← 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)
- Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs (Q2027064) (← links)
- New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach (Q2106743) (← links)
- Solution approaches for equitable multiobjective integer programming problems (Q2150765) (← links)
- Distribution based representative sets for multi-objective integer programs (Q2178085) (← links)
- Multi-objective integer programming: an improved recursive algorithm (Q2251549) (← links)
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems (Q2255968) (← links)
- A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems (Q2256164) (← links)
- A bi-objective model for the location of landfills for municipal solid waste (Q2256218) (← links)
- Bi-objective short-term scheduling in a rolling horizon framework: a priori approaches with alternative operational objectives (Q2273666) (← links)
- An extension of the non-inferior set estimation algorithm for many objectives (Q2301933) (← links)
- GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs (Q2327904) (← links)
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems (Q2342947) (← links)
- Computing the nadir point for multiobjective discrete optimization problems (Q2350075) (← links)
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem (Q2356097) (← links)
- Dynamic rerouting of vehicles during cooperative wildfire response operations (Q2400029) (← links)
- A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method (Q2802251) (← links)
- An exact method to generate all nondominated spanning trees (Q2954355) (← links)
- Finding integer efficient solutions for multiple objective network programming problems (Q3087624) (← links)
- Multiobjective Integer Programming: Synergistic Parallel Approaches (Q3386777) (← links)
- Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches (Q4599312) (← links)
- Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems (Q4995057) (← links)
- Network Models for Multiobjective Discrete Optimization (Q5086002) (← links)
- Disjunctive Programming for Multiobjective Discrete Optimisation (Q5137948) (← links)
- A branch‐and‐bound algorithm for representative integer efficient solutions in multiple objective network programming problems (Q5326806) (← links)
- Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems (Q6048198) (← links)
- Optimization of a linear function over an integer efficient set (Q6059580) (← links)
- A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising (Q6069770) (← links)
- Bi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests (Q6080592) (← links)
- Effective anytime algorithm for multiobjective combinatorial optimization problems (Q6086280) (← links)
