Pages that link to "Item:Q1751179"

The following pages link to The envy-free pricing problem, unit-demand markets and connections with the network pricing problem (Q1751179):

Displaying 7 items.

• The rank pricing problem: models and branch-and-cut algorithms (Q1722958) (← links)
• Approximation algorithms for the max-buying problem with limited supply (Q1755724) (← links)
• The rank pricing problem with ties (Q2239986) (← links)
• Competitive location and pricing on a line with metric transportation costs (Q2282503) (← links)
• On envy-free perfect matching (Q2414450) (← links)
• Mixed-integer formulations for the capacitated rank pricing problem with envy (Q2669780) (← links)
• A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)