A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method (Q2802251): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1287/ijoc.2015.0657 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2194405083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Triangle Splitting Method for Biobjective Mixed Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the bi-criterion integer programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discussion of scalarization techniques for multiple objective integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A revised simplex method for linear multiple objective programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding representative systems for discrete bicriterion optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all nondominated points of multi-objective integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multiobjective multidimensional knapsack problem: a survey and a new approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-objective integer programming: a general approach for generating all non-dominated solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-objective integer programming: an improved recursive algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two phase algorithms for the bi-objective assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for solving biobjective integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem / 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: A method for finding the set of non-dominated vectors for multiple objective integer linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance of the MOSA method for the bicriteria assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The set of all nondominated solutions in linear cases and a multicriteria simplex method / rank
 
Normal rank

Latest revision as of 21:22, 11 July 2024

scientific article
Language Label Description Also known as
English
A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method
scientific article

    Statements

    A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method (English)
    0 references
    0 references
    0 references
    25 April 2016
    0 references
    0 references
    biobjective integer programming
    0 references
    criterion space search algorithm
    0 references
    balanced box method
    0 references
    0 references