A discussion of scalarization techniques for multiple objective integer programming (Q2379880): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10479-006-0074-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2027360559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of efficient solutions for vector maximization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear multiple objective programs with zero–one variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and algorithms for linear multiple objective programs with zero–one variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: The matroidal knapsack: A class of (often) well-solvable problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3760254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on combinatorial optimization with max-linear objective functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computing an Initial Efficient Extreme Point / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all efficient extreme points for multiple objective linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey and annotated bibliography of multiobjective combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing robust crew schedules with bicriteria optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4667002 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unified interactive multiple objective programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3706826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming duality in multiple objective programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for mixed zero-one multiple objective linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interactive weighted Tchebycheff procedure for multiple objective programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the completeness and constructiveness of parametric characterizations to vector optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529748 / rank
 
Normal rank

Latest revision as of 15:22, 2 July 2024

scientific article
Language Label Description Also known as
English
A discussion of scalarization techniques for multiple objective integer programming
scientific article

    Statements

    A discussion of scalarization techniques for multiple objective integer programming (English)
    0 references
    0 references
    23 March 2010
    0 references
    0 references
    Lagrangian duality
    0 references
    elastic constraints
    0 references
    crew scheduling
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references