default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYves Pochet
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
[j19]Benoît Roland, Christine Di Martinelly
, Fouad Riane, Yves Pochet:
Scheduling an operating theatre under human resource constraints. Comput. Ind. Eng. 58(2): 212-220 (2010)- [j18]Géraldine Strack, Yves Pochet:
An integrated model for warehouse and inventory planning. Eur. J. Oper. Res. 204(1): 35-50 (2010) - [j17]Yves Pochet, Laurence A. Wolsey:
Single item lot-sizing with non-decreasing capacities. Math. Program. 121(1): 123-143 (2010) - [j16]Kent Andersen, Yves Pochet:
Coefficient strengthening: a tool for reformulating mixed-integer programs. Math. Program. 122(1): 121-154 (2010)
2000 – 2009
- 2009
- [j15]Ayse Akbalik, Yves Pochet:
Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs. Eur. J. Oper. Res. 198(2): 412-434 (2009) - [j14]Simge Küçükyavuz, Yves Pochet:
Uncapacitated lot sizing with backlogging: the convex hull. Math. Program. 118(1): 151-175 (2009) - 2008
- [j13]Yves Pochet, François Warichet:
A tighter continuous time formulation for the cyclic scheduling of a mixed plant. Comput. Chem. Eng. 32(11): 2723-2744 (2008) - [c5]Yves Pochet, Mathieu Van Vyve:
LS-LIB: A Library of Tools for Solving Production Planning Problems. Bonn Workshop of Combinatorial Optimization 2008: 317-346 - 2006
- [c4]Iliyana Simeonova, François Warichet, Georges Bastin, Denis Dochain, Yves Pochet:
Feedback stabilization of the Operation of an Hybrid Chemical plant. ADHS 2006: 191-198 - 2004
- [j12]Sourour Elloumi, Martine Labbé, Yves Pochet:
A New Formulation and Resolution Method for the p-Center Problem. INFORMS J. Comput. 16(1): 83-94 (2004) - [j11]Yves Pochet, Mathieu Van Vyve:
A General Heuristic for Production Planning Problems. INFORMS J. Comput. 16(3): 316-327 (2004) - 2001
- [j10]Denis Naddef, Yves Pochet:
The Symmetric Traveling Salesman Polytope Revisited. Math. Oper. Res. 26(4): 700-722 (2001) - [j9]Marko Loparic, Yves Pochet, Laurence A. Wolsey:
The uncapacitated lot-sizing problem with sales and safety stocks. Math. Program. 89(3): 487-504 (2001) - [j8]Oktay Günlük, Yves Pochet:
Mixing mixed-integer inequalities. Math. Program. 90(3): 429-457 (2001) - [c3]Yves Pochet:
Mathematical Programming Models and Formulations for Deterministic Production Planning Problems. Computational Combinatorial Optimization 2001: 57-111
1990 – 1999
- 1998
- [j7]Jeroen P. van den Berg, Gunter P. Sharp, A. J. R. M. Gademann, Yves Pochet:
Forward-reserve allocation in a warehouse with unit-load replenishments. Eur. J. Oper. Res. 111(1): 98-113 (1998) - [j6]Yves Pochet, Robert Weismantel:
The Sequential Knapsack Polytope. SIAM J. Optim. 8(1): 248-264 (1998) - 1995
- [j5]Yves Pochet, Laurence A. Wolsey:
Integer Knapsack and Flow Covers with Divisible Coefficients: Polyhedra, optimization and Separation. Discret. Appl. Math. 59(1): 57-74 (1995) - [j4]Karen I. Aardal, Yves Pochet, Laurence A. Wolsey:
Capacitated Facility Location: Valid Inequalities and Facets. Math. Oper. Res. 20(3): 562-582 (1995) - 1994
- [j3]Yves Pochet, Laurence A. Wolsey:
Polyhedra for lot-sizing with Wagner-Whitin costs. Math. Program. 67: 297-323 (1994) - 1993
- [j2]Yves Pochet, Laurence A. Wolsey:
Lot-Sizing with Constant Batches: Formulation and Valid Inequalities. Math. Oper. Res. 18(4): 767-785 (1993) - [c2]Yves Pochet, Laurence A. Wolsey:
Algorithms and reformulations for lot sizing problems. Combinatorial Optimization 1993: 245-293 - 1992
- [c1]Yves Pochet, Laurence A. Wolsey:
Network Design with Divisible Capacities: Aggregated Flow and Knapsack Subproblems. IPCO 1992: 150-164
1980 – 1989
- 1988
- [j1]Yves Pochet, Laurence A. Wolsey:
Lot-size models with backlogging: Strong reformulations and cutting planes. Math. Program. 40(1-3): 317-335 (1988)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
