Solving 0–1 integer programs with unknown knapsack constraints using membership oracles
- 31 October 2026
- journal article
- research article
- Published by Springer Nature in Computational Optimization and Applications
- p. 1-36
Abstract
No abstract availableKeywords
This publication has 68 references indexed in Scilit:
- Edge User Allocation with Dynamic Quality of Service2019
- Derivative-Free and Blackbox Optimization2017
- Active learning with support vector machinesWIREs Data Mining and Knowledge Discovery, 2014
- Learning surrogate models for simulation‐based optimizationAIChE Journal, 2014
- Support vector machinesWIREs Computational Statistics, 2009
- Representative Sampling for Text Classification Using Support Vector Machines2003
- Complexity estimates of some cutting plane methods based on the analytic barrierMathematical Programming, 1995
- On the computation of weighted analytic centers and dual ellipsoids with the projective algorithmMathematical Programming, 1993
- A branch and bound algorithm for the generalized assignment problemMathematical Programming, 1975
- Newton's method for convex programming and Tchebycheff approximationNumerische Mathematik, 1959