scientific article; zbMATH DE number 2190133
From MaRDI portal
Publication:5462193
zbMath1105.90094MaRDI QIDQ5462193
Carlos A. S. Oliveira, Cláudio N. Meneses, Oleg A. Prokopyev, Panos M. Pardalos
Publication date: 1 August 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Fractional programming (90C32) Search theory (90B40)
Related Items
A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem ⋮ A review of recent advances in global optimization ⋮ A global optimization algorithm for solving the minimum multiple ratio spanning tree problem ⋮ A geometric branch-and-bound algorithm for the service bundle design problem ⋮ Fractional 0-1 programming and submodularity ⋮ Finding checkerboard patterns via fractional 0-1 programming ⋮ Fractional 0-1 programming: applications and algorithms ⋮ A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems ⋮ Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems ⋮ Submodularity in Conic Quadratic Mixed 0–1 Optimization ⋮ A branch-and-cut algorithm for the latent-class logit assortment problem ⋮ Scheduling tasks with exponential duration on unrelated parallel machines ⋮ Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations ⋮ Feature selection for consistent biclustering via fractional 0-1 programming ⋮ The maximum ratio clique problem
This page was built for publication:
