default search action
Search dblp for Publications
export results for "toc:db/journals/disopt/disopt47.bht:"
@article{DBLP:journals/disopt/AndresGIL23, author = {Bjoern Andres and Silvia Di Gregorio and Jannik Irmai and Jan{-}Hendrik Lange}, title = {A polyhedral study of lifted multicuts}, journal = {Discret. Optim.}, volume = {47}, pages = {100757}, year = {2023}, url = {https://doi.org/10.1016/j.disopt.2022.100757}, doi = {10.1016/J.DISOPT.2022.100757}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/disopt/AndresGIL23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/disopt/AtaeiD23, author = {Homa Ataei and Mansoor Davoodi}, title = {The p-center problem under locational uncertainty of demand points}, journal = {Discret. Optim.}, volume = {47}, pages = {100759}, year = {2023}, url = {https://doi.org/10.1016/j.disopt.2023.100759}, doi = {10.1016/J.DISOPT.2023.100759}, timestamp = {Tue, 28 Mar 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/disopt/AtaeiD23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/disopt/BerendGT23, author = {Daniel Berend and Shahar Golan and Yochai Twitto}, title = {{CHAMP:} {A} multipass algorithm for Max Sat based on saver variables}, journal = {Discret. Optim.}, volume = {47}, pages = {100760}, year = {2023}, url = {https://doi.org/10.1016/j.disopt.2023.100760}, doi = {10.1016/J.DISOPT.2023.100760}, timestamp = {Tue, 28 Mar 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/disopt/BerendGT23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/disopt/BlazejCKKSV23, author = {V{\'{a}}clav Blazej and Pratibha Choudhary and Dusan Knop and Jan Maty{\'{a}}s Kristan and Ondrej Such{\'{y}} and Tom{\'{a}}s Valla}, title = {Constant factor approximation for tracking paths and fault tolerant feedback vertex set}, journal = {Discret. Optim.}, volume = {47}, pages = {100756}, year = {2023}, url = {https://doi.org/10.1016/j.disopt.2022.100756}, doi = {10.1016/J.DISOPT.2022.100756}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/disopt/BlazejCKKSV23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/disopt/CarrHP23, author = {Robert D. Carr and Arash Haddadan and Cynthia A. Phillips}, title = {Fractional Decomposition Tree Algorithm: {A} tool for studying the integrality gap of Integer Programs}, journal = {Discret. Optim.}, volume = {47}, pages = {100746}, year = {2023}, url = {https://doi.org/10.1016/j.disopt.2022.100746}, doi = {10.1016/J.DISOPT.2022.100746}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/disopt/CarrHP23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/disopt/Jager23, author = {Sven J{\"{a}}ger}, title = {An improved greedy algorithm for stochastic online scheduling on unrelated machines}, journal = {Discret. Optim.}, volume = {47}, pages = {100753}, year = {2023}, url = {https://doi.org/10.1016/j.disopt.2022.100753}, doi = {10.1016/J.DISOPT.2022.100753}, timestamp = {Tue, 28 Mar 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/disopt/Jager23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/disopt/YuanLY23, author = {Qixuan Yuan and Ruifang Liu and Jinjiang Yuan}, title = {The A{\(\alpha\)}-spectral radius of nonregular graphs (digraphs) and maximum degree (outdegree)}, journal = {Discret. Optim.}, volume = {47}, pages = {100758}, year = {2023}, url = {https://doi.org/10.1016/j.disopt.2022.100758}, doi = {10.1016/J.DISOPT.2022.100758}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/disopt/YuanLY23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.