Learning in combinatorial optimization: what and how to explore
From MaRDI portal
Recommendations
Cites work
- 50 Years of Integer Programming 1958-2008
- X-armed bandits
- A brief history of linear and mixed-integer programming computation
- A compact linear program for testing optimality of perfect matchings.
- A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
- A Structured Multiarmed Bandit Problem and the Greedy Policy
- Adaptive routing with end-to-end feedback: distributed learning and geometric approaches
- Asymptotically efficient adaptive allocation rules
- Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: I.I.D. rewards
- Combinatorial bandits
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Dynamic assortment optimization with a multinomial logit choice model and capacity constraint
- Dynamic assortment with demand learning for seasonal consumer goods
- Elements of Information Theory
- Finite-time analysis of the multiarmed bandit problem
- Fitting piecewise linear continuous functions
- scientific article; zbMATH DE number 3889341 (Why is no real title available?)
- scientific article; zbMATH DE number 4078557 (Why is no real title available?)
- scientific article; zbMATH DE number 3638998 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 1102774 (Why is no real title available?)
- scientific article; zbMATH DE number 795222 (Why is no real title available?)
- scientific article; zbMATH DE number 5485582 (Why is no real title available?)
- Imposing Connectivity Constraints in Forest Planning Models
- Information collection on a graph
- Linearly parameterized bandits
- Mixed integer linear programming formulation techniques
- Mixed integer programming: analyzing 12 years of progress
- Multi-armed bandit problems with multiple plays and switching cost
- Prediction, Learning, and Games
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- Solving Steiner tree problems in graphs to optimality
- Some \(0/1\) polytopes need exponential size extended formulations
- Some aspects of the sequential design of experiments
- The Continuum-Armed Bandit Problem
- The design of approximation algorithms
- The knowledge gradient algorithm for a general class of online learning problems
- The Nonstochastic Multiarmed Bandit Problem
- The Set-Covering Problem: A New Implicit Enumeration Algorithm
- Using separation algorithms to generate mixed integer model reformulations
Cited in
(11)- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem
- Using computational learning strategies as a tool for combinatorial optimization
- Scenario-based learning for stochastic combinatorial optimisation
- A learning based algorithm for drone routing
- Sequential interdiction with incomplete information and learning
- Matching while learning
- A diverse human learning optimization algorithm
- The Exploration-Exploitation Trade-off in the Newsvendor Problem
- Computational complexity of combinatorial optimization problems induced by collective procedures in machine learning
- Maximum likelihood probability measures over sets: existence, computation, and convergence
- Optimal sequential stochastic shortest path interdiction
This page was built for publication: Learning in combinatorial optimization: what and how to explore
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5144784)
