Skip to main content
Article thumbnail
Location of Repository

Hybrid Combinatorial Optimization: Sample Problems and Algorithms

By Vaibhav Srivastava and Francesco Bullo

Abstract

Abstract — We study a class of non-convex optimization problems involving sigmoid functions. We show that sigmoid functions impart a combinatorial element to the optimization variables and make them hybrid of continuous and discrete variables. We formulate versions of the knapsack problem and the bin-packing problem with such hybrid variables. We utilize the approximation algorithms from the combinatorial optimization literature and develop approximation algorithms for these NP-hard hybrid optimization problems. I

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.1563
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://motion.me.ucsb.edu/pdf/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.