Abstract: We study the problem of incorporating risk while making combinatorial decisions under uncertainty. We formulate a discrete submodular maximization problem for selecting a set using ...

Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or ...

A network optimizer that decides which inbound containers to unload, on which day, and to which building, so that the most demand is covered at a target service level under a daily unloading limit. It ...

# Copyright 2023 The Google Research Authors. # Licensed under the Apache License, Version 2.0 (the "License"); # you may not use this file except in compliance with ...