Pages that link to "Item:Q2802251"

The following pages link to A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method (Q2802251):

Displayed 38 items.

• The \(L\)-shape search method for triobjective integer programming (Q298165) ‎ (← links)
• The bi-objective mixed capacitated general routing problem with different route balance criteria (Q322701) ‎ (← links)
• SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems (Q828878) ‎ (← links)
• Nondominated Nash points: application of biobjective mixed integer programming (Q1653352) ‎ (← links)
• A hybrid approach for biobjective optimization (Q1662163) ‎ (← links)
• Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems (Q1750397) ‎ (← links)
• Fathoming rules for biobjective mixed integer linear programs: review and extensions (Q1751199) ‎ (← links)
• The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs (Q1753507) ‎ (← links)
• A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs (Q1753510) ‎ (← links)
• Bi-objective autonomous vehicle repositioning problem with travel time uncertainty (Q2026711) ‎ (← links)
• Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs (Q2027064) ‎ (← links)
• Decomposition of loosely coupled integer programs: a multiobjective perspective (Q2097645) ‎ (← links)
• Bi-objective multistage stochastic linear programming (Q2097668) ‎ (← links)
• Bi-objective facility location under uncertainty with an application in last-mile disaster relief (Q2108809) ‎ (← links)
• Balance in resource allocation problems: a changing reference approach (Q2178919) ‎ (← links)
• Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming (Q2286918) ‎ (← links)
• Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization (Q2297563) ‎ (← links)
• FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming (Q2329715) ‎ (← links)
• A two-stage approach for bi-objective integer linear programming (Q2417052) ‎ (← links)
• An exact algorithm for biobjective integer programming problems (Q2668742) ‎ (← links)
• Computing representations using hypervolume scalarizations (Q2669609) ‎ (← links)
• An \(\varepsilon \)-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problems (Q2669681) ‎ (← links)
• A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method (Q2802241) ‎ (← links)
• A NEW APPROACH TO SELECT THE BEST SUBSET OF PREDICTORS IN LINEAR REGRESSION MODELLING: BI-OBJECTIVE MIXED INTEGER LINEAR PROGRAMMING (Q3122035) ‎ (← links)
• Multiobjective Integer Programming: Synergistic Parallel Approaches (Q3386777) ‎ (← links)
• The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints (Q5085468) ‎ (← links)
• Branch-and-Bound for Biobjective Mixed-Integer Linear Programming (Q5085998) ‎ (← links)
• Solving Multiobjective Mixed Integer Convex Optimization Problems (Q5131967) ‎ (← links)
• A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming (Q5137441) ‎ (← links)
• Branch-and-Bound for Bi-objective Integer Programming (Q5139633) ‎ (← links)
• A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs (Q5139635) ‎ (← links)
• A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method (Q5139845) ‎ (← links)
• Optimal hierarchical clustering on a graph (Q6065857) ‎ (← links)
• Bi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests (Q6080592) ‎ (← links)
• An exact criterion space search method for a bi-objective nursing home location and allocation problem (Q6102633) ‎ (← links)
• Twenty years of continuous multiobjective optimization in the twenty-first century (Q6114911) ‎ (← links)
• Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix (Q6120849) ‎ (← links)
• An exact criterion space search algorithm for a bi-objective blood collection problem (Q6168602) ‎ (← links)