Pages that link to "Item:Q3468895"
From MaRDI portal
The following pages link to An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming (Q3468895):
Displaying 14 items.
- An interactive approach for biobjective integer programs under quasiconvex preference functions (Q512966) (← links)
- A review of interactive methods for multiobjective integer and mixed-integer programming (Q869154) (← links)
- A class of practical interactive branch and bound algorithms for multicriteria integer programming (Q1075953) (← links)
- Comparative studies in interactive multiple objective mathematical programming (Q1266708) (← links)
- On a constructive approximation of the efficient outcomes in bicriterion vector optimization (Q1330805) (← links)
- Interactive bicriterion solution method and its application to critical path method problems (Q1336070) (← links)
- An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound (Q1577993) (← links)
- Fathoming rules for biobjective mixed integer linear programs: review and extensions (Q1751199) (← links)
- Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic (Q1887952) (← links)
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem (Q1908646) (← links)
- An improved algorithm for solving biobjective integer programs (Q2379864) (← links)
- Bicriteria integer quadratic programming problems (Q2709837) (← links)
- An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization (Q3722261) (← links)
- An interactive paired comparison method for bicriterion integer programming (Q4287997) (← links)
