A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints (Q2442073): 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 / OpenAlex ID
 
Property / OpenAlex ID: W2066875648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New branch-and-Cut algorithm for bilevel linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Algorithm for the Bilevel Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual decomposition in stochastic integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An overview of bilevel optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3377692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of bilevel programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrange Multipliers and Nonconvex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Representation and Economic Interpretation of a Two-Level Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Benders decomposition method for discretely-constrained mathematical programs with equilibrium constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Branch-and-Bound Rules for Linear Bilevel Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Global Solution of Linear Programs with Linear Complementarity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive facility location on decentralized supply chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global solution of nonlinear mixed-integer bilevel programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mixed Integer Linear Bilevel Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4156141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution method for mixed integer bi-level linear problems based on decomposition technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cross decomposition for mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cross Decomposition Algorithm for Capacitated Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for solving the mixed integer two-level linear programming problem / rank
 
Normal rank

Latest revision as of 13:28, 7 July 2024

scientific article
Language Label Description Also known as
English
A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints
scientific article

    Statements

    A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    31 March 2014
    0 references
    mathematical program with equilibrium constraints
    0 references
    bilevel programming
    0 references
    discrete planning and decision making
    0 references
    optimization
    0 references
    branch-and-bound method
    0 references
    global optimization
    0 references
    0 references
    0 references
    0 references

    Identifiers

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