Pages that link to "Item:Q3057150"

The following pages link to A polyhedral study of the network pricing problem with connected toll arcs (Q3057150):

Displaying 13 items.

• Efficient heuristic algorithms for maximum utility product pricing problems (Q342312) (← links)
• Valid inequalities and branch-and-cut for the clique pricing problem (Q665989) (← links)
• The envy-free pricing problem, unit-demand markets and connections with the network pricing problem (Q1751179) (← links)
• Bilevel road pricing: theoretical analysis and optimality conditions (Q1761815) (← links)
• The hub location and pricing problem (Q2140288) (← links)
• Competitive location and pricing on a line with metric transportation costs (Q2282503) (← links)
• On a stochastic bilevel programming problem (Q2892149) (← links)
• The Envy-Free Pricing Problem and Unit-Demand Markets (Q3195332) (← links)
• Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
• A Catalog of Formulations for the Network Pricing Problem (Q5058007) (← links)
• Bilevel programming and price setting problems (Q5917900) (← links)
• Bilevel programming and price setting problems (Q5925163) (← links)
• A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)