Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: J Comb Optim

Search In Journal Title:

Abbravation: Journal of Combinatorial Optimization

Search In Journal Abbravation:

Publisher

Springer US

Search In Publisher:

DOI

10.1016/j.bbrc.2004.06.023

Search In DOI:

ISSN

1573-2886

Search In ISSN:
Search In Title Of Papers:

A Lagrangian bound for manytomany assignment pro

Authors: Igor Litvinchev Socorro Rangel Jania Saucedo
Publish Date: 2008/12/02
Volume: 19, Issue: 3, Pages: 241-257
PDF Link

Abstract

A simple procedure to tighten the Lagrangian bounds is proposed The approach is interpreted in two ways First it can be seen as a reformulation of the original problem aimed to split the resulting Lagrangian problem into two subproblems Second it can be considered as a search for a tighter estimation of the penalty term arising in the Lagrangian problem The new bounds are illustrated by a small example and studied numerically for a class of the generalized assignment problems

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. New bounds for the balloon popping problem
  2. An exact algorithm for the maximum probabilistic clique problem
  3. A two-stage method for member selection of emergency medical service
  4. Budget-constrained minimum cost flows
  5. On the complexity of partitioning a graph into a few connected subgraphs
  6. Median problems with positive and negative weights on cycles and cacti
  7. The unconstrained binary quadratic programming problem: a survey
  8. Multiple L ( j ,1)-labeling of the triangular lattice
  9. A hybrid algorithm based on variable neighbourhood for the strip packing problem
  10. Penalty guided genetic search for redundancy optimization in multi-state series-parallel power system
  11. Evaluation performance of genetic algorithm and tabu search algorithm for solving the Max-RWA problem in all-optical networks
  12. Modified differential evolution with self-adaptive parameters method
  13. Extremal polyomino chains with respect to general Randić index
  14. The weighted link ring loading problem
  15. A new recombination lower bound and the minimum perfect phylogenetic forest problem
  16. Optimization of loss-balanced multicast in all-optical WDM networks
  17. Reconfiguration of dominating sets
  18. Approximate event detection over multi-modal sensing data
  19. Mobile facility location: combinatorial filtering via weighted occupancy
  20. Bounded information dissemination in multi-channel wireless networks
  21. Total coloring of planar graphs without adjacent short cycles
  22. Disjunctive total domination in graphs
  23. A quadratic lower bound for colourful simplicial depth
Search Result: