Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
type: Item
instance of: scholarly article
title: Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
zbMATH Open document ID: 0937.90038
DOI: 10.1016/S0377-2217(98)00269-0
author: Maria João Alves
author: Joao Carlos Namorado Climaco
published in: European Journal of Operational Research
publication date: 2000-06-14T00:00:00Z
Mathematics Subject Classification ID: 90B50
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 1358494
zbMATH Keywords: multicriteria analysis
zbMATH Keywords: integer programming
zbMATH Keywords: linear programming
zbMATH Keywords: cutting planes
MaRDI profile type: Publication
Wikidata QID: Q57664335
cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs
cites work: Gomory cuts revisited
cites work: Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
cites work: Fenchel Cutting Planes for Integer Programs
cites work: Q4139985
cites work: Analysis of mathematical programming problems prior to applying the simplex algorithm
cites work: Cutting planes for integer programs with general integer variables
cites work: Chvátal closures for mixed integer programming problems
cites work: Solving Large-Scale Zero-One Linear Programming Problems
cites work: An Overview of Techniques for Solving Multiobjective Mathematical Programs
cites work: Q5645210
cites work: Sensitivity analysis in multiobjective decision making
cites work: Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
cites work: An interactive procedure for multiple objective integer linear programming problems
cites work: A reference direction approach to multiple objective integer linear programming
cites work: Aspiration based decision support systems. Theory, software and applications
cites work: Use of reference points of MOLP problems analysis
cites work: An interactive algorithm for solving multiple objective integer linear programming problems
cites work: Solving Mixed Integer Programming Problems Using Automatic Reformulation
cites work: Q3815146
cites work: An interactive weighted Tchebycheff procedure for multiple objective programming
cites work: Q4726043
cites work: Q3743134
cites work: Multi‐objective combinatorial optimization problems: A survey
cites work: A Reference Direction Algorithm for Solving Multiple Objective Integer Linear Programming Problems
cites work: Q3875728
full work available at URL: s0377-2217(98)00269-0
OpenAlex ID: W1973064890
DBLP publication ID: journals/eor/AlvesC99
description: scientific article; zbMATH DE number 1358494