Keyword: programming: linear

Found 1928 papers in total
On Soft Power Diagrams
2015,
Many applications in operations research begin with a set of points in a Euclidean...
Freight car dispatching with generalized flows
2015,
In the freight car dispatching problem, empty freight cars have to be assigned to...
An extended slacks-based measure model for data envelopment analysis with negative data
2015,
Data envelopment analysis (DEA) is a non‐parametric approach based on linear...
An adaptive guidance meta-heuristic for the vehicle routing problem with splits and clustered backhauls
2015,
This paper presents the case study of an Italian carrier, Grendi Trasporti Marittimi,...
An algorithm and upper bounds for the weighted maximal planar graph problem
2015,
In this paper, we investigate the weighted maximal planar graph (WMPG) problem. Given...
Minimizing total completion time on a single machine with step improving jobs
2015,
Production systems often experience a shock or a technological change, resulting in...
A mathematical programming model for a multi-objective supplier selection and order allocation problem with fuzzy objectives
2015,
This paper studies a multi‐objective supplier selection and order allocation...
A possibilistic environment based particle swarm optimization for aggregate production planning
2015,
Development of an Aggregate Production Plan (APP), the top most level in a...
Determining the best shipper sizes for sending products to customers
2016,
A distribution company has to send products, packed into shippers, from the warehouse...
A compact linear programming formulation of the maximum concurrent flow problem
2015,
We present an alternative linear programming formulation of the maximum concurrent...
A branch-and-cut algorithm for the multi-vehicle traveling purchaser problem with pairwise incompatibility constraints
2015,
We introduce a problem where a fleet of vehicles is available to visit suppliers...
Analysis of operations of port using mathematical and simulation modelling
2015,
This paper proposes an integer linear programming (ILP) and discrete event...
Characterizing a subset of the PPS maintaining the reference hyperplane of the radial projection point
2014,
In this paper, we characterize a subset of the production possibility set consisting...
Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection
2015,
We introduce and study the Travelling Salesman Problem with Multiple Time Windows and...
Using medians in portfolio optimization
2015,
Some new portfolio optimization models are formulated by adopting the sample median...
Semi-decentralized approximation of optimal control of distributed systems based on a functional calculus
2015,
This paper discusses a new approximation method for operators that are solution to an...
Linear-quadratic control problems with L1-control cost
2015,
We analyze a class of linear‐quadratic optimal control problems with an...
Applying software engineering techniques in the development and management of linear and integer programming applications
2014,
This work addresses characteristics of software environments for mathematical modeling...
Dual power assignment optimization and fault tolerance in WSNs
2015,
Because of limited battery equipped on each sensor, power consumption is one of the...
A tabu search heuristic approach for allocating operating room capacity
2014,
In this paper, two methodologies for allocating hospital operating room (OR)...
Multi-objective flow shop scheduling problem with stochastic parameters: fuzzy goal programming approach
2014,
Flow shop scheduling problem with stochastic parameters is dealt with in this paper. A...
Linear vs. quadratic portfolio selection models with hard real-world constraints
2015,
Several risk–return portfolio models take into account practical limitations on...
A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization
2015,
We give a subexponential fixed parameter algorithm for one‐sided crossing...
Optimality cuts and a branch-and-cut algorithm for the K-rooted mini-max spanning forest problem
2015,
Let G = ( V, E ) be an undirected graph with costs associated with its edges and K...
Papers per page: