Geodesic

Special issue - Advanced Optimization Approaches and Modern OR-Applications

Sommaire

Foreword – Advanced Optimization Approaches and Modern OR-Applications
p. 677-679
Improving the solution complexity of the scheduling problem with deadlines: A general technique
p. 681-687
Solving the bi-objective Robust Vehicle Routing Problem with uncertain costs and demands
p. 689-714
Bi-objective optimization of single-machine batch scheduling under time-of-use electricity prices
p. 715-732
Single-machine past-sequence-dependent setup times scheduling with resource allocation and learning effect
p. 733-748
Automated Credit Rating Prediction in a competitive framework
p. 749-765
Competitive versus cooperative performances of a Stackelberg game between two suppliers
p. 767-780
Some complexity and approximation results for coupled-tasks scheduling problem according to topology
p. 781-795
Two stage decision making approach for Sensor Mission Assignment Problem
p. 797-807
Dominance measuring methods for the selection of cleaning services in a European underground transportation company
p. 809-824
Logic Gate-based Evolutionary Algorithm for the multidimensional knapsack problem-wireless sensor network application
p. 825-843
Optimal investment with transaction costs and dividends for an insurer
p. 845-855
An exact method to generate all nondominated spanning trees
p. 857-867
A novel meta-heuristic algorithm for multi-objective dynamic facility layout problem
p. 869-890
N-policy for a repairable redundant machining system with controlled rates
p. 891-907
Reneging in a batch arrival two phases queue with random feedback and Coxian-2 vacation
p. 909-920
Controllable lead time, service level constraint, and transportation discounts in a continuous review inventory model
p. 921-934
Complexity analysis of interior point methods for linear programming based on a parameterized kernel function
p. 935-949
Clustering of optimized data for email forensics
p. 951-963
Environmental efficiency analysis based on relational two-stage DEA model
p. 965-977
Super-polynomial approximation branching algorithms
p. 979-994
An improved binary search algorithm for the Multiple-Choice Knapsack Problem
p. 995-1001
On the average lower bondage number of a graph
p. 1003-1012
New conjugate gradient method for unconstrained optimization
p. 1013-1026
A Genetic Algorithm for an inventory system under belief structure inflationary conditions
p. 1027-1041