Pages that link to "Item:Q1174273"

The following pages link to Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem (Q1174273):

Displaying 15 items.

• Efficient automated schematic map drawing using multiobjective mixed integer programming (Q337580) (← links)
• An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems (Q828841) (← links)
• Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study (Q853072) (← links)
• A review of interactive methods for multiobjective integer and mixed-integer programming (Q869154) (← links)
• Analyzing tradeoffs between zonal constraints and accessibility in facility location (Q1317094) (← links)
• An interactive procedure dedicated to a bicriteria plant location model. (Q1413829) (← links)
• An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound (Q1577993) (← links)
• A modular capacitated multi-objective model for locating maritime search and rescue vessels (Q1615931) (← links)
• Multiobjective solution of the uncapacitated plant location problem (Q1869487) (← links)
• The complete vertex \(p\)-center problem (Q2219518) (← links)
• Multi-objective competitive location problem with distance-based attractiveness and its best non-dominated solution (Q2290286) (← links)
• A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems (Q2342947) (← links)
• An improved algorithm for solving biobjective integer programs (Q2379864) (← links)
• Approximation methods in multiobjective programming (Q2583199) (← links)
• Bicriteria integer quadratic programming problems (Q2709837) (← links)