Pages that link to "Item:Q4929860"

The following pages link to A Benders decomposition method for discretely-constrained mathematical programs with equilibrium constraints (Q4929860):

Displaying 11 items.

• Solving discretely-constrained Nash-Cournot games with an application to power markets (Q300326) (← links)
• Solving a location problem of a Stackelberg firm competing with Cournot-Nash firms (Q301071) (← links)
• Enhanced models and improved solution for competitive biofuel supply chain design under land use constraints (Q320925) (← links)
• Optimizing system resilience: a facility protection model with recovery time (Q439415) (← links)
• Bilevel programming for price-based electricity auctions: a revenue-constrained case (Q748595) (← links)
• AAR-based decomposition algorithm for non-linear convex optimisation (Q902092) (← links)
• Measuring the effects of price controls using mixed complementarity models (Q1713764) (← links)
• An analytical approach to the protection planning of a rail intermodal terminal network (Q1752835) (← links)
• Dual market facility network design under bounded rationality (Q2331464) (← links)
• A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints (Q2442073) (← links)
• A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints (Q2629907) (← links)