Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Marcia Fampa
Information about the author Marcia Fampa will soon be added to the site.
Found
6 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Linear programing relaxations for a strategic pricing problem in electricity markets
2017
Strategic bidding problems in energy markets have been vastly studied in the...
Column generation approaches for the software clustering problem
2016
This work presents the application of branch‐and‐price approaches to the...
An overview of exact algorithms for the Euclidean Steiner tree problem in n-space
2016
The Euclidean Steiner tree problem (ESTP) in Rn is to find a shortest network...
Mixed‐Integer Linear Programming Formulations for the Software Clustering Problem
2013
The clustering problem has an important application in software engineering, which...
An improved algorithm for computing Steiner minimal trees in Euclidean d-space
2008
We describe improvements to Smith's branch-and-bound (B&B) algorithm for the...
A new relaxation in conic form for the Suclidean Steiner problem in ℜn
2001
In this paper, we present a new mathematical programming formulation for the Euclidean...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers