Recommendations
Cites work
Cited in
(4)- Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon
- Efficient heuristic algorithms for maximum utility product pricing problems
- On complexity classes of envy-free pricing problems: a short survey
- An efficient alternative strategy for finding prices in envy-free perfect matchings
This page was built for publication: A pricing problem under Monge property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q951107)