Pages that link to "Item:Q665989"
From MaRDI portal
The following pages link to Valid inequalities and branch-and-cut for the clique pricing problem (Q665989):
Displaying 10 items.
- Efficient heuristic algorithms for maximum utility product pricing problems (Q342312) (← links)
- New formulations and valid inequalities for a bilevel pricing problem (Q935200) (← links)
- The envy-free pricing problem, unit-demand markets and connections with the network pricing problem (Q1751179) (← links)
- Competitive location and pricing on a line with metric transportation costs (Q2282503) (← links)
- A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs (Q2423295) (← links)
- A polyhedral study of the network pricing problem with connected toll arcs (Q3057150) (← links)
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← 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)
