Journal: 4OR

Found 137 papers in total
Constrained auction clearing in the Italian electricity market
Constrained auction clearing in the Italian electricity market
2004,
Most of the liberalized electricity systems use the auction as a market model. The...
Process selection and sequencing in a two-agents production system
Process selection and sequencing in a two-agents production system
2003,
This paper addresses a coordination problem concerning two production agents in a...
The Dial-a-Ride Problem (DARP): Variants, modelling issues and algorithms
The Dial-a-Ride Problem (DARP): Variants, modelling issues and algorithms
2003,
The Dial-a-Ride Problem (DARP) consists of designing vehicle routes and schedules for...
Two exact algorithms for the capacitated p-median problem
Two exact algorithms for the capacitated p-median problem
2003,
The p-median problem has been widely studied in combinatorial optimisation, but its...
Upper bounds on the independence and the clique covering number
Upper bounds on the independence and the clique covering number
2003,
New upper bounds for the independence number and for the clique covering number of a...
Chemical trees enumeration algorithms
Chemical trees enumeration algorithms
2003,
In the chemical community the need for representing chemical structures within a given...
Bottleneck shortest paths on a partially ordered scale
Bottleneck shortest paths on a partially ordered scale
2003,
In bottleneck combinatorial problems, admissible solutions are compared with respect...
A new implementation of Yen's ranking loopless paths algorithm
A new implementation of Yen's ranking loopless paths algorithm
2003,
Yen's algorithm is a classical algorithm for ranking the K shortest loopless paths...
Network synthesis under survivability constraints
Network synthesis under survivability constraints
2004,
Telecommunication networks are subject to link and equipment failures. Since failures...
The omnipresence of Lagrange
The omnipresence of Lagrange
2003,
Lagrangian relaxation is usually considered in the combinatorial optimization...
Abaffy, Broyden and Spedicato methods and ABSPACK for linear systems and optimization: A review
Abaffy, Broyden and Spedicato methods and ABSPACK for linear systems and optimization: A review
2003,
ABS methods are a large class of methods, based upon the Egervary rank reducing...
Embedding optimisation algorithms with Mosel
Embedding optimisation algorithms with Mosel
2003,
Algebraic modelling language allow models to be implemented in such a way that they...
Design issues for combinatorial auctions
Design issues for combinatorial auctions
2004,
Combinatorial auctions are an important class of market mechanisms in which...
A note on a new variant of Murty's ranking assignments algorithm
A note on a new variant of Murty's ranking assignments algorithm
2003,
In this paper a variant of Murty's algorithm for ranking assignments according to cost...
Primal separation algorithms
Primal separation algorithms
2003,
Given an integer polyhedron P I ⊂ ℝ n , an integer point &xmacr; ∈ P I ,...
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
2003,
In this survey we attempt to give a unified presentation of a variety of results on...
Trust-region algorithms for derivative-free optimization and nonlinear bilevel programming
Trust-region algorithms for derivative-free optimization and nonlinear bilevel programming
2004,
We briefly describe the contents of the author's PhD thesis discussed on July 2003 at...
Papers per page: