Results 151 to 160 of about 417,011 (184)
Some of the next articles are maybe not open access.
Computers and Operations Research, 2012
Recently several hybrid methods combining exact algorithms and heuristics have been proposed for solving hard combinatorial optimization problems. In this paper, we propose new iterative relaxation-based heuristics for the 0-1 Mixed Integer Programming problem (0-1 MIP), which generate a sequence of lower and upper bounds. The upper bounds are obtained
Said Hanafi, Christophe Wilbaut
exaly +2 more sources
Recently several hybrid methods combining exact algorithms and heuristics have been proposed for solving hard combinatorial optimization problems. In this paper, we propose new iterative relaxation-based heuristics for the 0-1 Mixed Integer Programming problem (0-1 MIP), which generate a sequence of lower and upper bounds. The upper bounds are obtained
Said Hanafi, Christophe Wilbaut
exaly +2 more sources
An Exact Algorithm for the Biobjective 0-1 Linear Knapsack Problem with a Single Continuous Variable
International Conference on Parallel and Distributed Computing: Applications and Technologies, 2017Hongtao Liu
exaly +2 more sources
The 0-1 Knapsack problem with a single continuous variable [PDF]
Mathematical Programming, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
MARCHAND, Hugues, WOLSEY, Laurence A.
openaire +1 more source
On the continuous quadratic knapsack problem
Mathematical Programming, 1992zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A. G. Robinson, N. Jiang, C. S. Lerme
openaire +1 more source
A class of nonlinear nonseparable continuous knapsack and multiple-choice knapsack problems
Mathematical Programming, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Thomas C. Sharkey +2 more
openaire +2 more sources
An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems
SIAM Review, 2000A root-finding problem is considered, arising in the solution of a class of nonlinear knapsack problems. The function whose root needs to be computed presents two challenges. First, it cannot be explicitly expressed in terms of the variable, and second, it is singular at the endpoints of the interval containing the root, making it unsuitable for any ...
Aaron Melman, Gad Rabinowitz
openaire +1 more source
The continuous collapsing Knapsack problem
Mathematical Programming, 1983A Collapsing Knapsack is a container whose capacity diminishes as the number of items it must hold is increased. This paper focuses on those cases in which the decision variables are continuous, i.e., can take any non-negative value. It is demonstrated that the problem can be reduced to a set of two dimensional subproblems.
openaire +1 more source
Continuous Equality Knapsack with Probit-Style Objectives
Journal of Optimization Theory and Applications, 2022We study continuous, equality knapsack problems with uniform separable, non-convex objective functions that are continuous, antisymmetric about a point, and have concave and convex regions.
Jamie Fravel +2 more
semanticscholar +1 more source
A Novel Continuous Optimization Approach for the 0-1 Knapsack Problem
Anais do XX Seminário de Iniciação Científica e Tecnológica da UTFPR, 2015Felipe F Lopes, Alireza Mohebi Ahstiani
semanticscholar +2 more sources
Continuous maximin knapsack problems with GLB constraints
Mathematical Programming, 1986The author proposes an O(n log n) time algorithm for solving the problem \[ \max \min \{c_ jx_ j\},\quad \Sigma a_ jx_ j1_ k,\quad k=1,\quad...,\quad t\}. \] A subproblem with one constraint \(x\in P_ k\) may be solved analytically. A solution of the main problem may be found by simple analysis of the solutions of subproblems.
openaire +2 more sources