A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/disopt/PanCALM19
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/disopt/PanCALM19
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Lucas_L%E2%88%9A%C2%A9tocart
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Mahuna_Akplogan
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Nora_Touati_Moungla
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Roberto_Wolfler_Calvo
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Stefania_Pan
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1016%2Fj.disopt.2019.05.001
>
foaf:
homepage
<
https://doi.org/10.1016/j.disopt.2019.05.001
>
dc:
identifier
DBLP journals/disopt/PanCALM19
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1016%2Fj.disopt.2019.05.001
(xsd:string)
dcterms:
issued
2019
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/disopt
>
rdfs:
label
A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Lucas_L%E2%88%9A%C2%A9tocart
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Mahuna_Akplogan
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Nora_Touati_Moungla
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Roberto_Wolfler_Calvo
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Stefania_Pan
>
swrc:
pages
146-168
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/disopt/PanCALM19/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/disopt/PanCALM19
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/disopt/disopt33.html#PanCALM19
>
rdfs:
seeAlso
<
https://doi.org/10.1016/j.disopt.2019.05.001
>
dc:
title
A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
33
(xsd:string)