bounded-regret.ghost.io/a-fun-optimization-problem

Preview meta tags from the bounded-regret.ghost.io website.

Linked Hostnames

14

Thumbnail

Search Engine Appearance

Google

https://bounded-regret.ghost.io/a-fun-optimization-problem

A Fun Optimization Problem

I spent the last several hours trying to come up with an efficient algorithm to the following problem: Problem:Suppose that we have a sequence of $l$ pairs of non-negative numbers $(a_1,b_1),\ldots,(a_l,b_l)$ such that $\sum_{i=1}^l a_i \leq A$



Bing

A Fun Optimization Problem

https://bounded-regret.ghost.io/a-fun-optimization-problem

I spent the last several hours trying to come up with an efficient algorithm to the following problem: Problem:Suppose that we have a sequence of $l$ pairs of non-negative numbers $(a_1,b_1),\ldots,(a_l,b_l)$ such that $\sum_{i=1}^l a_i \leq A$



DuckDuckGo

https://bounded-regret.ghost.io/a-fun-optimization-problem

A Fun Optimization Problem

I spent the last several hours trying to come up with an efficient algorithm to the following problem: Problem:Suppose that we have a sequence of $l$ pairs of non-negative numbers $(a_1,b_1),\ldots,(a_l,b_l)$ such that $\sum_{i=1}^l a_i \leq A$

  • General Meta Tags

    8
    • title
      A Fun Optimization Problem
    • charset
      utf-8
    • viewport
      width=device-width, initial-scale=1
    • referrer
      no-referrer-when-downgrade
    • article:published_time
      2013-02-09T08:00:00.000Z

  • Open Graph Meta Tags

    8
    • og:site_name
      Bounded Regret
    • og:type
      article
    • og:title
      A Fun Optimization Problem
    • og:description
      I spent the last several hours trying to come up with an efficient algorithm to the following problem: Problem:Suppose that we have a sequence of $l$ pairs of non-negative numbers $(a_1,b_1),\ldots,(a_l,b_l)$ such that $\sum_{i=1}^l a_i \leq A$
    • og:url
      https://bounded-regret.ghost.io/a-fun-optimization-problem/

  • Twitter Meta Tags

    10
    • twitter:card
      summary_large_image
    • twitter:title
      A Fun Optimization Problem
    • twitter:description
      I spent the last several hours trying to come up with an efficient algorithm to the following problem: Problem:Suppose that we have a sequence of $l$ pairs of non-negative numbers $(a_1,b_1),\ldots,(a_l,b_l)$ such that $\sum_{i=1}^l a_i \leq A$
    • twitter:url
      https://bounded-regret.ghost.io/a-fun-optimization-problem/
    • twitter:image
      https://bounded-regret.ghost.io/content/images/2021/08/logo2-1.png

  • Link Tags

    8
    • alternate
      https://bounded-regret.ghost.io/rss/
    • amphtml
      https://bounded-regret.ghost.io/a-fun-optimization-problem/amp/
    • canonical
      https://bounded-regret.ghost.io/a-fun-optimization-problem/
    • icon
      https://bounded-regret.ghost.io/content/images/size/w256h256/2021/08/logo2.png
    • stylesheet
      /assets/built/screen.css?v=34c06d3eba

Links

21