Pages that link to "Item:Q2016277"

The following pages link to An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems (Q2016277):

Displaying 49 items.

• Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems (Q274932) (← links)
• Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
• A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods (Q331779) (← links)
• Efficient automated schematic map drawing using multiobjective mixed integer programming (Q337580) (← links)
• An exact algorithm for biobjective mixed integer linear programming problems (Q342401) (← links)
• Environmental corporate responsibility for investments evaluation: an alternative multi-objective programming model (Q513081) (← links)
• A multi-objective, hub-and-spoke model to design and manage biofuel supply chains (Q513645) (← links)
• An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics (Q670759) (← links)
• Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations (Q724117) (← links)
• SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems (Q828878) (← links)
• A hybrid approach for biobjective optimization (Q1662163) (← links)
• A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems (Q1754103) (← links)
• An efficient Lagrangian-based heuristic to solve a multi-objective sustainable supply chain problem (Q2031073) (← links)
• Ambulance routing in disaster response considering variable patient condition: NSGA-II and MOPSO algorithms (Q2076371) (← links)
• New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach (Q2106743) (← links)
• A novel hybrid multi-objective algorithm to solve the generalized cubic cell formation problem (Q2108168) (← links)
• Tactical level strategies for multi-objective disassembly line balancing problem with multi-manned stations: an optimization model and solution approaches (Q2108816) (← links)
• Design of a heuristic algorithm for the generalized multi-objective set covering problem (Q2149956) (← links)
• Solution approaches for equitable multiobjective integer programming problems (Q2150765) (← links)
• An integrated bi-objective U-shaped assembly line balancing and parts feeding problem: optimization model and exact solution method (Q2163842) (← links)
• Distribution based representative sets for multi-objective integer programs (Q2178085) (← links)
• Planning tank-truck hazardous materials shipments in intercity road transportation networks (Q2245875) (← links)
• A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems (Q2256164) (← links)
• Decision support models in climate policy (Q2272294) (← links)
• An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets (Q2282534) (← links)
• Multi-objective evolutionary algorithms for a reliability location problem (Q2286920) (← links)
• Multi-objective optimization model for a downstream oil and gas supply chain (Q2294883) (← links)
• GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs (Q2327904) (← links)
• Robustness analysis in multi-objective mathematical programming using Monte Carlo simulation (Q2629615) (← links)
• A multi-objective decision-making model for supplier selection considering transport discounts and supplier capacity constraints (Q2666742) (← links)
• A two-phase Pareto front method for solving the bi-objective personnel task rescheduling problem (Q2669725) (← links)
• Dynamic routing-scheduling problem for home health care considering caregiver-patient compatibility (Q2676402) (← 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)
• A multi-product model for evaluating and selecting two layers of suppliers considering environmental factors (Q4578148) (← links)
• Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems (Q4995057) (← links)
• Branch-and-Bound for Biobjective Mixed-Integer Linear Programming (Q5085998) (← links)
• Advanced network connectivity features and zonal requirements in covering location problems (Q6047840) (← links)
• A hub-and-spoke architecture for a parcel delivery system using the cross-docking distribution strategy (Q6048039) (← links)
• A multi-criteria decision framework for sustainable supplier selection and order allocation using multi-objective optimization and fuzzy approach (Q6048160) (← links)
• Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems (Q6048198) (← links)
• An extended ϵ‐constraint method for a multiobjective finite‐horizon Markov decision process (Q6060650) (← links)
• A multi-objective mixed integer linear programming model for thesis defence scheduling (Q6069217) (← links)
• A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising (Q6069770) (← links)
• An ERNSGA‐III algorithm for the production and distribution planning problem in the multiagent supply chain (Q6091879) (← links)
• Multi-objective decision method for airport landside rapid transit network design (Q6147913) (← links)
• Investigating of transportation systems development for urban districts, costs and social equity: a case of Sanandaj, Kurdistan (Q6151247) (← links)
• The open location-routing problem for multi-objective optimization of sustainable supply chain considering social concerns (Q6175351) (← links)
• A data-driven optimization model to response to COVID-19 pandemic: a case study (Q6179178) (← links)
• An extended \(\varepsilon \)-constraint method for a bi-objective assortment optimization problem (Q6495397) (← links)