Bilevel biobjective pseudo Boolean programming problems (Q2392546): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Cost-time trade-off in three-axial sums' transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for the assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Programs with Optimization Problems in the Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Joint Design and Pricing on a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-parametric programming approach for multilevel hierarchical and decentralised optimisation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3397634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal traffic signal control for an \(M\times N\) traffic network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality conditions in bilevel multiobjective programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A medical resources allocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3102311 / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN ALGORITHM FOR A MULTIOBJECTIVE, MULTILEVEL LINEAR PROGRAMMING / rank
 
Normal rank

Latest revision as of 17:39, 6 July 2024

scientific article
Language Label Description Also known as
English
Bilevel biobjective pseudo Boolean programming problems
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references