# Unconstrained Rational Combinatorial Optimization

When thinking up a new TSP heuristic, I encountered the following rational combinatorial optimization problem: $$\min_{\alpha \in \lbrace0,1\rbrace^n}\frac{\alpha^T w}{\alpha^T m},\quad w \in \mathbb{R}^n, \ m\in\mathbb{N}^n,\ \|\alpha\|\ne 0$$ and must admit, that I don't have any good idea of how to go about solving it to optimality besides using brute force; I am not even sure, how a branch-and-bound method would have to be formulated.

Questions:

• can the above problem be converted to a non-rational one, from which the optimal solution to the original problem can be efficiently (i.e. in polynomial time) be reconstructed?
• what algorithms can be recommended for practical problems, where good solutions are sufficient?

Edit:
I just saw, that Nimrod Megiddo had published a paper on that subject already in 1979.
If the question is considered pointless now, please vote to close.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.7436822652816772, "perplexity": 228.70727201144777}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2021-43/segments/1634323588257.34/warc/CC-MAIN-20211028034828-20211028064828-00115.warc.gz"}