Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems

DOI10.1016/S0377-2217(98)00269-0zbMath0937.90038OpenAlexW1973064890WikidataQ57664335 ScholiaQ57664335MaRDI QIDQ1806944

Maria João Alves, Joao Carlos Namorado Climaco

Publication date: 14 June 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00269-0

zbMATH Keywords

linear programminginteger programmingmulticriteria analysiscutting planes

Mathematics Subject Classification ID

Integer programming (90C10) Multi-objective and goal programming (90C29) Management decision making, including multiple objectives (90B50)

Related Items (12)

Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives ⋮ The biobjective travelling purchaser problem ⋮ A reference point technique to compute nondominated solutions in MOLFP ⋮ An improved algorithm for solving biobjective integer programs ⋮ Convex preference cone-based approach for many objective optimization problems ⋮ An interactive algorithm to find the most preferred solution of multi-objective integer programs ⋮ A review of interactive methods for multiobjective integer and mixed-integer programming ⋮ Indifference sets of reference points in multi-objective integer linear programming ⋮ A note on a decision support system for multiobjective integer and mixed-integer programming problems. ⋮ An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint ⋮ An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound ⋮ Cone contraction and reference point methods for multi-criteria mixed integer optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chvátal closures for mixed integer programming problems
• A reference direction approach to multiple objective integer linear programming
• Aspiration based decision support systems. Theory, software and applications
• Sensitivity analysis in multiobjective decision making
• Cutting planes for integer programs with general integer variables
• An interactive procedure for multiple objective integer linear programming problems
• Use of reference points of MOLP problems analysis
• An interactive algorithm for solving multiple objective integer linear programming problems
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Gomory cuts revisited
• An Overview of Techniques for Solving Multiobjective Mathematical Programs
• Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
• Solving Large-Scale Zero-One Linear Programming Problems
• Analysis of mathematical programming problems prior to applying the simplex algorithm
• Fenchel Cutting Planes for Integer Programs
• A Reference Direction Algorithm for Solving Multiple Objective Integer Linear Programming Problems
• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
• Solving Mixed Integer Programming Problems Using Automatic Reformulation
• An interactive weighted Tchebycheff procedure for multiple objective programming
• Multi‐objective combinatorial optimization problems: A survey

This page was built for publication: Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems