Login / Signup
Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems.
Boadu Mensah Sarpong
Christian Artigues
Nicolas Jozefowiez
Published in:
RAIRO Oper. Res. (2015)
Keyphrases
</>
combinatorial optimization problems
bi objective
column generation
knapsack problem
optimal solution
branch and bound
lower bound
shortest path problem
linear programming relaxation
combinatorial optimization
ant colony optimization
metaheuristic
set covering problem
branch and bound algorithm
efficient solutions
upper bound
np hard
linear programming
lagrangian relaxation
linear program
integer program
mixed integer programming
multiple objectives
set partitioning
optimization problems
exact algorithms
exact solution
test problems
objective function
nsga ii
integer programming
traveling salesman problem
multi objective
search space
particle swarm optimization
max sat
set covering
heuristic methods
lower and upper bounds
worst case
dynamic programming
neural network
valid inequalities
simulated annealing
differential evolution
vehicle routing problem
multi objective optimization