Remove journal abbreviations from references
This commit is contained in:
parent
d771d3ec3e
commit
669ad29176
@ -73,7 +73,7 @@
|
||||
J. Stuckey},
|
||||
title = {{CP} and {IP} approaches to cancer radiotherapy delivery optimization
|
||||
},
|
||||
journal = {Constraints An Int. J.},
|
||||
journal = {Constraints},
|
||||
volume = 16,
|
||||
number = 2,
|
||||
pages = {173--194},
|
||||
@ -161,16 +161,13 @@
|
||||
author = {Gustav Bj{\"{o}}rdal and Jean{-}No{\"{e}}l Monette and Pierre Flener
|
||||
and Justin Pearson},
|
||||
title = {A constraint-based local search backend for MiniZinc},
|
||||
journal = {Constraints An Int. J.},
|
||||
journal = {Constraints},
|
||||
volume = 20,
|
||||
number = 3,
|
||||
pages = {325--345},
|
||||
year = 2015,
|
||||
url = {https://doi.org/10.1007/s10601-015-9184-z},
|
||||
doi = {10.1007/s10601-015-9184-z},
|
||||
timestamp = {Fri, 13 Mar 2020 10:58:30 +0100},
|
||||
biburl = {https://dblp.org/rec/journals/constraints/BjordalMFP15.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org},
|
||||
}
|
||||
|
||||
@inproceedings{brand-2006-propagation,
|
||||
@ -215,16 +212,13 @@
|
||||
author = {Marco Chiarandini and Luca Di Gaspero and Stefano Gualandi and
|
||||
Andrea Schaerf},
|
||||
title = {The balanced academic curriculum problem revisited},
|
||||
journal = {J. Heuristics},
|
||||
journal = {Journal of Heuristics},
|
||||
volume = 18,
|
||||
number = 1,
|
||||
pages = {119--148},
|
||||
year = 2012,
|
||||
url = {https://doi.org/10.1007/s10732-011-9158-2},
|
||||
doi = {10.1007/s10732-011-9158-2},
|
||||
timestamp = {Fri, 30 Nov 2018 13:23:27 +0100},
|
||||
biburl = {https://dblp.org/rec/journals/heuristics/ChiarandiniGGS12.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org},
|
||||
}
|
||||
|
||||
@software{chuffed-2021-chuffed,
|
||||
@ -268,7 +262,7 @@
|
||||
issn = {0362-1340},
|
||||
url = {https://doi.org/10.1145/390013.808480},
|
||||
doi = {10.1145/390013.808480},
|
||||
journal = {SIGPLAN Not.},
|
||||
journal = {{ACM} SIGPLAN Notices},
|
||||
month = jul,
|
||||
pages = {20–24},
|
||||
numpages = 5,
|
||||
@ -313,7 +307,7 @@
|
||||
issn = {0004-5411},
|
||||
url = {https://doi.org/10.1145/321033.321034},
|
||||
doi = {10.1145/321033.321034},
|
||||
journal = {J. ACM},
|
||||
journal = {Journal of the {ACM}},
|
||||
month = jul,
|
||||
pages = {201–215},
|
||||
numpages = {15},
|
||||
@ -331,7 +325,7 @@
|
||||
issn = {0001-0782},
|
||||
url = {https://doi.org/10.1145/368273.368557},
|
||||
doi = {10.1145/368273.368557},
|
||||
journal = {Commun. ACM},
|
||||
journal = {Communications of the {ACM}},
|
||||
month = jul,
|
||||
pages = {394–397},
|
||||
numpages = 4,
|
||||
@ -377,7 +371,7 @@
|
||||
@article{fischetti-2014-erratiscism,
|
||||
author = {Matteo Fischetti and Michele Monaci},
|
||||
title = {Exploiting Erraticism in Search},
|
||||
journal = {Oper. Res.},
|
||||
journal = {Operations Research},
|
||||
volume = {62},
|
||||
number = {1},
|
||||
pages = {114--122},
|
||||
@ -426,16 +420,13 @@
|
||||
author = {Robert Fourer and David M. Gay},
|
||||
title = {Extending an Algebraic Modeling Language to Support Constraint
|
||||
Programming},
|
||||
journal = {{INFORMS} J. Comput.},
|
||||
journal = {{INFORMS} Journal on Computing},
|
||||
volume = 14,
|
||||
number = 4,
|
||||
pages = {322--344},
|
||||
year = 2002,
|
||||
url = {https://doi.org/10.1287/ijoc.14.4.322.2825},
|
||||
doi = {10.1287/ijoc.14.4.322.2825},
|
||||
timestamp = {Sun, 15 Mar 2020 19:45:41 +0100},
|
||||
biburl = {https://dblp.org/rec/journals/informs/FourerG02.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org},
|
||||
}
|
||||
|
||||
@book{fourer-2003-ampl,
|
||||
@ -451,16 +442,13 @@
|
||||
@article{freuder-1997-holygrail,
|
||||
author = {Eugene C. Freuder},
|
||||
title = {In Pursuit of the Holy Grail},
|
||||
journal = {Constraints An Int. J.},
|
||||
journal = {Constraints},
|
||||
volume = 2,
|
||||
number = 1,
|
||||
pages = {57--61},
|
||||
year = 1997,
|
||||
url = {https://doi.org/10.1023/A:1009749006768},
|
||||
doi = {10.1023/A:1009749006768},
|
||||
timestamp = {Fri, 13 Mar 2020 10:58:24 +0100},
|
||||
biburl = {https://dblp.org/rec/journals/constraints/Freuder97.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org},
|
||||
}
|
||||
|
||||
@inproceedings{frisch-2007-essence,
|
||||
@ -521,16 +509,13 @@
|
||||
@article{fruhwirth-1998-chr,
|
||||
author = {Thom W. Fr{\"{u}}hwirth},
|
||||
title = {Theory and Practice of Constraint Handling Rules},
|
||||
journal = {J. Log. Program.},
|
||||
journal = {The Journal of Logic Programming},
|
||||
volume = 37,
|
||||
number = {1-3},
|
||||
pages = {95--138},
|
||||
year = 1998,
|
||||
url = {https://doi.org/10.1016/S0743-1066(98)10005-5},
|
||||
doi = {10.1016/S0743-1066(98)10005-5},
|
||||
timestamp = {Wed, 17 Feb 2021 08:54:37 +0100},
|
||||
biburl = {https://dblp.org/rec/journals/jlp/Fruhwirth98.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org},
|
||||
}
|
||||
|
||||
@software{gecode-2021-gecode,
|
||||
@ -544,15 +529,12 @@
|
||||
@article{gebser-2012-clasp,
|
||||
author = {Martin Gebser and Benjamin Kaufmann and Torsten Schaub},
|
||||
title = {Conflict-driven answer set solving: From theory to practice},
|
||||
journal = {Artif. Intell.},
|
||||
journal = {Artificial Intelligence},
|
||||
volume = 187,
|
||||
pages = {52--89},
|
||||
year = 2012,
|
||||
url = {https://doi.org/10.1016/j.artint.2012.04.001},
|
||||
doi = {10.1016/j.artint.2012.04.001},
|
||||
timestamp = {Fri, 09 Apr 2021 18:34:15 +0200},
|
||||
biburl = {https://dblp.org/rec/journals/ai/GebserKS12.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org},
|
||||
}
|
||||
|
||||
@inproceedings{gokberk-2020-ess-incr,
|
||||
@ -650,47 +632,38 @@
|
||||
author = {Christopher Jefferson and Neil C. A. Moore and Peter Nightingale and
|
||||
Karen E. Petrie},
|
||||
title = {Implementing logical connectives in constraint programming},
|
||||
journal = {Artif. Intell.},
|
||||
journal = {Artificial Intelligence},
|
||||
volume = 174,
|
||||
number = {16-17},
|
||||
pages = {1407--1429},
|
||||
year = 2010,
|
||||
url = {https://doi.org/10.1016/j.artint.2010.07.001},
|
||||
doi = {10.1016/j.artint.2010.07.001},
|
||||
timestamp = {Sat, 16 Sep 2017 12:06:14 +0200},
|
||||
biburl = {https://dblp.org/rec/journals/ai/JeffersonMNP10.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org},
|
||||
}
|
||||
|
||||
@article{jones-2002-multi-objective,
|
||||
author = {Dylan F. Jones and S. Keyvan Mirrazavi and Mehrdad Tamiz},
|
||||
title = {Multi-objective meta-heuristics: An overview of the current
|
||||
state-of-the-art},
|
||||
journal = {Eur. J. Oper. Res.},
|
||||
journal = {European Journal of Operational Research},
|
||||
volume = 137,
|
||||
number = 1,
|
||||
pages = {1--9},
|
||||
year = 2002,
|
||||
url = {https://doi.org/10.1016/S0377-2217(01)00123-0},
|
||||
doi = {10.1016/S0377-2217(01)00123-0},
|
||||
timestamp = {Fri, 21 Feb 2020 13:15:05 +0100},
|
||||
biburl = {https://dblp.org/rec/journals/eor/JonesMT02.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org},
|
||||
}
|
||||
|
||||
@article{karmarkar-1984-interior-point,
|
||||
author = {Narendra Karmarkar},
|
||||
title = {A new polynomial-time algorithm for linear programming},
|
||||
journal = {Comb.},
|
||||
journal = {Combinatorica},
|
||||
volume = {4},
|
||||
number = {4},
|
||||
pages = {373--396},
|
||||
year = {1984},
|
||||
url = {https://doi.org/10.1007/BF02579150},
|
||||
doi = {10.1007/BF02579150},
|
||||
timestamp = {Wed, 22 Jul 2020 22:02:37 +0200},
|
||||
biburl = {https://dblp.org/rec/journals/combinatorica/Karmarkar84.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org},
|
||||
}
|
||||
|
||||
@article{kolisch-1997-psplib,
|
||||
@ -766,16 +739,13 @@
|
||||
author = {Robin Lougee{-}Heimer},
|
||||
title = {The Common Optimization INterface for Operations Research: Promoting
|
||||
open-source software in the operations research community},
|
||||
journal = {{IBM} J. Res. Dev.},
|
||||
journal = {{IBM} Journal of Research and Development},
|
||||
volume = 47,
|
||||
number = 1,
|
||||
pages = {57--66},
|
||||
year = 2003,
|
||||
url = {https://doi.org/10.1147/rd.471.0057},
|
||||
doi = {10.1147/rd.471.0057},
|
||||
timestamp = {Fri, 13 Mar 2020 10:54:17 +0100},
|
||||
biburl = {https://dblp.org/rec/journals/ibmrd/Lougee-Heimer03.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org},
|
||||
}
|
||||
|
||||
@inproceedings{marinov-2005-sat-optimisations,
|
||||
@ -814,16 +784,13 @@
|
||||
author = {Kim Marriott and Nicholas Nethercote and Reza Rafeh and Peter J.
|
||||
Stuckey and Maria Garcia de la Banda and Mark Wallace},
|
||||
title = {The Design of the Zinc Modelling Language},
|
||||
journal = {Constraints An Int. J.},
|
||||
journal = {Constraints},
|
||||
volume = 13,
|
||||
number = 3,
|
||||
pages = {229--267},
|
||||
year = 2008,
|
||||
url = {https://doi.org/10.1007/s10601-008-9041-4},
|
||||
doi = {10.1007/s10601-008-9041-4},
|
||||
timestamp = {Fri, 13 Mar 2020 10:58:29 +0100},
|
||||
biburl = {https://dblp.org/rec/journals/constraints/MarriottNRSBW08.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org},
|
||||
}
|
||||
|
||||
@inproceedings{martins-2014-openwbo,
|
||||
@ -869,16 +836,13 @@
|
||||
@article{miller-1960-subtour,
|
||||
author = {C. E. Miller and A. W. Tucker and R. A. Zemlin},
|
||||
title = {Integer Programming Formulation of Traveling Salesman Problems},
|
||||
journal = {J. {ACM}},
|
||||
journal = {Journal of the {ACM}},
|
||||
volume = {7},
|
||||
number = {4},
|
||||
pages = {326--329},
|
||||
year = {1960},
|
||||
url = {https://doi.org/10.1145/321043.321046},
|
||||
doi = {10.1145/321043.321046},
|
||||
timestamp = {Wed, 14 Nov 2018 10:35:26 +0100},
|
||||
biburl = {https://dblp.org/rec/journals/jacm/MillerTZ60.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org},
|
||||
}
|
||||
|
||||
@software{minizinc-2021-minizinc,
|
||||
@ -912,15 +876,12 @@
|
||||
author = {Peter Nightingale and {\"{O}}zg{\"{u}}r Akg{\"{u}}n and Ian P. Gent
|
||||
and Christopher Jefferson and Ian Miguel and Patrick Spracklen},
|
||||
title = {Automatically improving constraint models in Savile Row},
|
||||
journal = {Artif. Intell.},
|
||||
journal = {Artificial Intelligence},
|
||||
volume = {251},
|
||||
pages = {35--61},
|
||||
year = {2017},
|
||||
url = {https://doi.org/10.1016/j.artint.2017.07.001},
|
||||
doi = {10.1016/j.artint.2017.07.001},
|
||||
timestamp = {Fri, 27 Mar 2020 08:45:01 +0100},
|
||||
biburl = {https://dblp.org/rec/journals/ai/NightingaleAGJM17.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org},
|
||||
}
|
||||
|
||||
@software{perron-2021-ortools,
|
||||
@ -955,7 +916,7 @@
|
||||
@article{pisinger-2007-heuristic,
|
||||
author = {David Pisinger and Stefan Ropke},
|
||||
title = {A general heuristic for vehicle routing problems},
|
||||
journal = {Comput. Oper. Res.},
|
||||
journal = {Computers \& Operations Research},
|
||||
volume = 34,
|
||||
number = 8,
|
||||
pages = {2403--2435},
|
||||
@ -963,23 +924,18 @@
|
||||
url = {https://doi.org/10.1016/j.cor.2005.09.012},
|
||||
doi = {10.1016/j.cor.2005.09.012},
|
||||
timestamp = {Tue, 18 Feb 2020 13:56:22 +0100},
|
||||
biburl = {https://dblp.org/rec/journals/cor/PisingerR07.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org},
|
||||
}
|
||||
|
||||
@article{plaisted-1986-polarity,
|
||||
author = {David A. Plaisted and Steven Greenbaum},
|
||||
title = {A Structure-Preserving Clause Form Translation},
|
||||
journal = {J. Symb. Comput.},
|
||||
journal = {Journal of Symbolic Computation},
|
||||
volume = 2,
|
||||
number = 3,
|
||||
pages = {293--304},
|
||||
year = 1986,
|
||||
url = {https://doi.org/10.1016/S0747-7171(86)80028-1},
|
||||
doi = {10.1016/S0747-7171(86)80028-1},
|
||||
timestamp = {Wed, 17 Feb 2021 08:57:26 +0100},
|
||||
biburl = {https://dblp.org/rec/journals/jsc/PlaistedG86.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org},
|
||||
}
|
||||
|
||||
@manual{prudhomme-2016-choco,
|
||||
@ -1040,16 +996,13 @@
|
||||
author = {Stefan Ropke and David Pisinger},
|
||||
title = {An Adaptive Large Neighborhood Search Heuristic for the Pickup and
|
||||
Delivery Problem with Time Windows},
|
||||
journal = {Transp. Sci.},
|
||||
journal = {Transportation Science},
|
||||
volume = 40,
|
||||
number = 4,
|
||||
pages = {455--472},
|
||||
year = 2006,
|
||||
url = {https://doi.org/10.1287/trsc.1050.0135},
|
||||
doi = {10.1287/trsc.1050.0135},
|
||||
timestamp = {Tue, 08 Sep 2020 13:28:27 +0200},
|
||||
biburl = {https://dblp.org/rec/journals/transci/RopkeP06.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org},
|
||||
}
|
||||
|
||||
@book{rossi-2006-cp,
|
||||
@ -1074,16 +1027,13 @@
|
||||
author = {Alexander Schiendorfer and Alexander Knapp and Gerrit Anders and
|
||||
Wolfgang Reif},
|
||||
title = {MiniBrass: Soft constraints for MiniZinc},
|
||||
journal = {Constraints An Int. J.},
|
||||
journal = {Constraints},
|
||||
volume = 23,
|
||||
number = 4,
|
||||
pages = {403--450},
|
||||
year = 2018,
|
||||
url = {https://doi.org/10.1007/s10601-018-9289-2},
|
||||
doi = {10.1007/s10601-018-9289-2},
|
||||
timestamp = {Mon, 26 Oct 2020 09:00:47 +0100},
|
||||
biburl = {https://dblp.org/rec/journals/constraints/SchiendorferKAR18.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org},
|
||||
}
|
||||
|
||||
@book{schrijver-1998-mip,
|
||||
@ -1100,16 +1050,13 @@
|
||||
author = {Tom Schrijvers and Guido Tack and Pieter Wuille and Horst Samulowitz
|
||||
and Peter J. Stuckey},
|
||||
title = {Search combinators},
|
||||
journal = {Constraints An Int. J.},
|
||||
journal = {Constraints},
|
||||
volume = 18,
|
||||
number = 2,
|
||||
pages = {269--305},
|
||||
year = 2013,
|
||||
url = {https://doi.org/10.1007/s10601-012-9137-8},
|
||||
doi = {10.1007/s10601-012-9137-8},
|
||||
timestamp = {Fri, 13 Mar 2020 10:58:29 +0100},
|
||||
biburl = {https://dblp.org/rec/journals/constraints/SchrijversTWSS13.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org},
|
||||
}
|
||||
|
||||
@inproceedings{schulte-2000-deep,
|
||||
@ -1152,16 +1099,13 @@
|
||||
@article{schulte-2008-propagation,
|
||||
author = {Christian Schulte and Peter J. Stuckey},
|
||||
title = {Efficient constraint propagation engines},
|
||||
journal = {{ACM} Trans. Program. Lang. Syst.},
|
||||
journal = {{ACM} Transactions on Programming Languages and Systems},
|
||||
volume = 31,
|
||||
number = 1,
|
||||
pages = {2:1--2:43},
|
||||
year = 2008,
|
||||
url = {https://doi.org/10.1145/1452044.1452046},
|
||||
doi = {10.1145/1452044.1452046},
|
||||
timestamp = {Tue, 06 Nov 2018 12:51:29 +0100},
|
||||
biburl = {https://dblp.org/rec/journals/toplas/SchulteS08.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org},
|
||||
}
|
||||
|
||||
@inproceedings{schutt-2009-cumulative,
|
||||
@ -1216,16 +1160,13 @@
|
||||
@article{stuckey-2010-challenge,
|
||||
author = {Peter J. Stuckey and Ralph Becket and Julien Fischer},
|
||||
title = {Philosophy of the MiniZinc challenge},
|
||||
journal = {Constraints An Int. J.},
|
||||
journal = {Constraints},
|
||||
volume = 15,
|
||||
number = 3,
|
||||
pages = {307--316},
|
||||
year = 2010,
|
||||
url = {https://doi.org/10.1007/s10601-010-9093-0},
|
||||
doi = {10.1007/s10601-010-9093-0},
|
||||
timestamp = {Fri, 13 Mar 2020 10:58:27 +0100},
|
||||
biburl = {https://dblp.org/rec/journals/constraints/StuckeyBF10.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org},
|
||||
}
|
||||
|
||||
@inproceedings{stuckey-2013-functions,
|
||||
@ -1252,16 +1193,13 @@
|
||||
author = {Peter J. Stuckey and Thibaut Feydy and Andreas Schutt and Guido Tack
|
||||
and Julien Fischer},
|
||||
title = {The MiniZinc Challenge 2008-2013},
|
||||
journal = {{AI} Mag.},
|
||||
journal = {{AI} Magazine},
|
||||
volume = 35,
|
||||
number = 2,
|
||||
pages = {55--60},
|
||||
year = 2014,
|
||||
url = {https://doi.org/10.1609/aimag.v35i2.2539},
|
||||
doi = {10.1609/aimag.v35i2.2539},
|
||||
timestamp = {Tue, 25 Aug 2020 16:50:56 +0200},
|
||||
biburl = {https://dblp.org/rec/journals/aim/StuckeyFSTF14.bib},
|
||||
bibsource = {dblp computer science bibliography, https://dblp.org},
|
||||
}
|
||||
|
||||
@inproceedings{stuckey-2019-conditionals,
|
||||
@ -1313,7 +1251,7 @@
|
||||
issn = {1529-3785},
|
||||
url = {https://doi.org/10.1145/359496.359529},
|
||||
doi = {10.1145/359496.359529},
|
||||
journal = {ACM Trans. Comput. Logic},
|
||||
journal = {{ACM} Transactions on Computational Logic},
|
||||
month = oct,
|
||||
pages = {285–320},
|
||||
numpages = 36,
|
||||
|
Reference in New Issue
Block a user