Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Keyword: programming: integer
Found
3058 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Simultaneous lotsizing and scheduling on parallel machines
2002,
Meyr Herbert
This paper addresses the simultaneous lotsizing and scheduling of several products on...
Cellular network design site selection and frequency planning
2001,
Dutta Amitava
Deployment of cellular networks involves substantial capital investment. Competition...
Optimal base station positioning and channel assignment for third generation mobile networks by integer programming
2001,
Schmeink Michael
In this paper, discrete mathematical programming approaches are used to solve the...
Lower bounds for fixed spectrum frequency assignment
2001,
Smith D.H.
Determining lower bounds for the sum of weighted constraint violations in fixed...
Models and algorithms for terrestrial digital broadcasting
2001,
Sassano A.
The service provided by a Digital Video Broadcasting system in terms of coverage of...
Designing least-cost survivable wireless backhaul networks
2000,
Cox Louis Anthony
This paper presents a new heuristic algorithm for designing least-cost...
Environmental site evaluation of waste management facilities embedded into EUGÈNE model: A multicriteria approach
2002,
Vaillancourt Kathleen
EUGÈNE is a sophisticated mixed integer linear programming model developed to...
Modeling and solving an airline schedule generation problem
2001,
Erdmann A.
Since opening a new flight connection or closing an existing flight has a great impact...
Ship scheduling of fertilizer products
1999,
Fox Mike
This article describes a Mixed Integer Programming model to schedule ships with a...
An exact algorithm for the maximum k-club problem in an undirected graph
2002,
Laporte Gilbert
In this paper, we prove that the maximum k -club problem (M k CP) defined on an...
Network cost minimization using threshold-based discounting
2002,
Skorin-Kapov Jadranka
A network design problem in which every pair of nodes can communicate directly is...
A branch and cut method for the degree-constrained minimum spanning tree problem
2001,
Caccetta L.
A problem of interest in network design is that of finding, in a given weighted graph,...
Solving some lexicographic multi-objective combinatorial problems
2002,
Volgenant A.
The lexicographic multi-objective optimization problem ( r -LMOP) with r (sum or...
Indifference sets of reference points in multi-objective integer linear programming
2001,
Clmaco Joo
Reference point approaches for multi-objective problems rely on the definition of an...
Topological design of survivable mesh-based transport networks
2001,
Grover Wayne D.
The advent of Sonet and DWDM mesh-restorable networks which contain explicit...
The multiparametric 0–1-integer linear programming problem: A unified approach
2002,
Crema Alejandro
We designed an algorithm for the multiparametric 0–1-integer linear programming...
Quadratic integer programming with application to the chaotic mappings of complete multipartite graphs
2001,
Du D.Z.
In this paper, we study the chaotic mappings of complete multipartite graphs. The...
Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm
2001,
Scheithauer G.
When solving the one-dimensional cutting stock problem (1D CSP) as an integer linear...
A hospital facility layout problem finally solved
2001,
Krarup Jakob
This paper presents a history of a difficulty facility layout problem that falls into...
Optimisation models for re-routing air traffic flows in Europe
2001,
Ormerod R.J.
This paper focuses on the usability of optimisation models to support the re-routing...
Production of locomotive rosters for a multi-class multi-locomotive problem
2001,
Noble D.H.
This paper describes a problem faced by the Public Transport Corporation (PTC) in the...
Construction of rule-based assignment models
2002,
Azibi R.
Assignment refers to the problem of assigning objects or alternatives described on...
A branch-and-cut algorithm for the maximum cardinality stable set problem
2001,
Rossi F.
We propose a branch-and-cut algorithm for the Maximum Cardinality Stable Set problem....
The single allocation problem in the interacting three-hub network
2000,
Park Sungsoo
We consider the single allocation problem in the interacting three-hub network with...
First Page
78
79
80
81
82
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers