Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Keyword: programming: linear
Found
1928 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Interior proximal methods for quasiconvex optimization
2012,
Langenberg Nils
A generalized proximal point algorithm for the minimization of a nonconvex function on...
Exact penalty and error bounds in DC programming
2012,
Pham Dinh Tao
In the present paper, we are concerned with conditions ensuring the exact penalty for...
Multilevel, threshold‐based policies for cargo container security screening systems
2012,
McLay Laura A
To mitigate the threat of nuclear terrorism within the US using nuclear material that...
The α‐core in Cournot oligopoly TU‐games with capacity constraints
2012,
Lardon Aymeric
In cooperative Cournot oligopoly games, it is known that the β ‐core is...
A Randomized Linear Programming Method for Network Revenue Management with Product‐Specific No‐Shows
2012,
Talluri Kalyan
Revenue management practices often include overbooking capacity to account for...
An Experimental Study of Algorithms for Weighted Completion Time Scheduling
2002,
Baev I D
We consider the total weighted completion time scheduling problem for parallel...
A production–transportation problem with piecewise linear cost structures
2012,
Zhong Weijun
In this paper, we study a multistage production–transportation problem for a...
The Structure and Complexity of Sports Elimination Numbers
2002,
Gusfield
Identifying the teams that are already eliminated from contention for first place of a...
Caching Documents with Variable Sizes and Fetching Costs: An LP‐Based Approach
2002,
Cohen
We give an integer programming formulation of the paging problem with varying sizes...
Reducing the number of cuts in generating three‐staged cutting patterns
2012,
Cui Yaodong
Three‐staged guillotine patterns are widely used in the manufacturing industry...
Tractable Almost Stochastic Dominance
2012,
Ruszczynski Andrzej
LL‐Almost Stochastic Dominance (LL‐ASD) is a relaxation of the...
LP bounds in various constraint programming approaches for orthogonal packing
2012,
Belov G
We consider the 2D orthogonal feasibility problem (OPP‐2) and the 2D strip...
Closest assignment constraints in discrete location problems
2012,
Marn Alfredo
The objective of this paper is to identify the most promising sets of closest...
A mathematical formulation and complexity considerations for the blocks relocation problem
2012,
Vo Stefan
The blocks relocation problem (BRP) may be defined as follows: given a set of...
Mixed partial elasticities in constant returns‐to‐scale production technologies
2012,
Podinovski Victor V
Recently, developed a linear programming approach to the analysis and calculation of a...
Diophantine Quadratic Equation and Smith Normal Form Using Scaled Extended Integer Abaffy–Broyden–Spedicato Algorithms
2012,
Golpar-Raboky E
Classes of integer Abaffy–Broyden–Spedicato (ABS) methods have recently...
Near‐Linear Approximation Algorithms for Geometric Hitting Sets
2012,
Sharir Micha
Given a range space ( X , ℛ ) , where ℛ ⊂ 2 X , the hitting set...
A Primal‐Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties
2012,
Xu Dachuan
We consider the facility location problem with submodular penalties (FLPSP),...
Kernel Search: An application to the index tracking problem
2012,
Speranza M G
In this paper we study the problem of replicating the performances of a stock market...
Production scheduling with alternative process plans
2012,
apek R
This paper deals with a scheduling problem with alternative process plans that was...
Analytical design of optimal controllers in the class of logic‐dynamic (hybrid) systems
2011,
Bortakovskii A
The classical problem of analytical design of the optimal controllers which was stated...
Robust synchronization of dynamical networks with compensation of disturbances
2011,
Furtat I
In this paper, a robust output control scheme is proposed for a linear dynamical...
Qualitative and quantitative data envelopment analysis with interval data
2012,
Inuiguchi Masahiro
In this paper, we investigate DEA with interval input‐output data. First we...
How tight is the corner relaxation? Insights gained from the stable set problem
2012,
Cornujols Grard
The corner relaxation of a mixed‐integer linear program is a central concept in...
First Page
14
15
16
17
18
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers