×

Found 220 Documents (Results 1–100)

100
MathJax

Learning qualitative constraint networks. (English) Zbl 07533382

Alechina, Natasha (ed.) et al., 25th international symposium on temporal representation and reasoning. TIME 2018, Warsaw, Poland, October 15–17, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 120, Article 19, 13 p. (2018).
MSC:  68T20 68T05
PDF BibTeX XML Cite
Full Text: DOI

HMS: a hybrid multi-start algorithm for solving binary linear programs. (English) Zbl 1408.90335

Coelho, Vitor Nazário (ed.) et al., Selected short papers of the 5th international conference on variable neighborhood search (ICVNS’17), Ouro Preto, Brazil, 2–4, 2017. Amsterdam: Elsevier. Electron. Notes Discrete Math. 66, 7-14 (2018).
MSC:  90C59 90C09
PDF BibTeX XML Cite
Full Text: DOI

A lower bound on CNF encodings of the at-most-one constraint. (English) Zbl 1417.68198

Gaspers, Serge (ed.) et al., Theory and applications of satisfiability testing – SAT 2017. 20th international conference, Melbourne, VIC, Australia, August 28 – September 1, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10491, 412-428 (2017).
MSC:  68T20 68Q17
PDF BibTeX XML Cite
Full Text: DOI arXiv

Cavity method: message-passing from a physics perspective. (English) Zbl 1401.82048

Krzakala, Florent (ed.) et al., Statistical physics, optimization, inference and message-passing algorithms. Lecture notes of the Les Houches School of Physics (École de Physique des Houches): special issue, Les Houches, France, September 30 – October 11, 2013. Oxford: Oxford University Press (ISBN 978-0-19-874373-6/hbk). 95-125 (2016).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Proof of the satisfiability conjecture for large \(k\). (English) Zbl 1321.68304

Proceedings of the 47th annual ACM symposium on theory of computing, STOC ’15, Portland, OR, USA, June 14–17, 2015. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3536-2). 59-68 (2015).
MSC:  68Q25
PDF BibTeX XML Cite
Full Text: DOI arXiv

Satisfiability threshold for random regular NAE-SAT. (English) Zbl 1315.68148

Proceedings of the 46th annual ACM symposium on theory of computing, STOC ’14, New York, NY, USA, May 31 – June 3, 2014. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2710-7). 814-822 (2014).
MSC:  68Q25 68Q17 68Q87
PDF BibTeX XML Cite
Full Text: DOI arXiv

On solving mixed-integer constraint satisfaction problems with unbounded variables. (English) Zbl 1382.90067

Gomes, Carla (ed.) et al., Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 10th international conference, CPAIOR 2013, Yorktown Heights, NY, USA, May 18–22, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38170-6/pbk). Lecture Notes in Computer Science 7874, 216-233 (2013).
MSC:  90C11 68T20 90C27
PDF BibTeX XML Cite
Full Text: DOI

MACE4 and SEM: a comparison of finite model generators. (English) Zbl 1383.68083

Bonacina, Maria Paola (ed.) et al., Automated reasoning and mathematics. Essays in memory of William W. McCune. Berlin: Springer (ISBN 978-3-642-36674-1/pbk). Lecture Notes in Computer Science 7788. Lecture Notes in Artificial Intelligence, 101-130 (2013).
MSC:  68T15 03B35
PDF BibTeX XML Cite
Full Text: DOI

Answer set solving with lazy nogood generation. (English) Zbl 1281.68178

Dovier, Agostino (ed.) et al., Technical communications of the 28th international conference on logic programming (ICLP 2012), September 4–8, 2012, Budapest, Hungary. Papers based on the presentations at the conference. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-43-9). LIPIcs – Leibniz International Proceedings in Informatics 17, 188-200, electronic only (2012).
MSC:  68T05 68T15 68T27 68N17
PDF BibTeX XML Cite
Full Text: DOI

Extending a CIP framework to solve MIQCPs. (English) Zbl 1242.90120

Lee, Jon (ed.) et al., Mixed integer nonlinear programming. Selected papers based on the presentations at the IMA workshop mixed-integer nonlinear optimization: Algorithmic advances and applications, Minneapolis, MN, USA, November 17–21, 2008. New York, NY: Springer (ISBN 978-1-4614-1926-6/hbk; 978-1-4614-1927-3/ebook). The IMA Volumes in Mathematics and its Applications 154, 427-444 (2012).
PDF BibTeX XML Cite
Full Text: DOI Link

Using expression graphs in optimization algorithms. (English) Zbl 1242.90131

Lee, Jon (ed.) et al., Mixed integer nonlinear programming. Selected papers based on the presentations at the IMA workshop mixed-integer nonlinear optimization: Algorithmic advances and applications, Minneapolis, MN, USA, November 17–21, 2008. New York, NY: Springer (ISBN 978-1-4614-1926-6/hbk; 978-1-4614-1927-3/ebook). The IMA Volumes in Mathematics and its Applications 154, 247-262 (2012).
PDF BibTeX XML Cite
Full Text: DOI Link

Efficient constraint propagation for graph coloring. (English) Zbl 1268.68149

Bonomo, Flavia (ed.) et al., LAGOS’11 – VI Latin-American algorithms, graphs, and optimization symposium. Extended abstracts from the symposium, Bariloche, Argentina, March 28–April 1, 2011. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 37, 243-248 (2011).
MSC:  68T20 05C15 05C85
PDF BibTeX XML Cite
Full Text: DOI

Timetable edge finding filtering algorithm for discrete cumulative resources. (English) Zbl 1302.90090

Achterberg, Tobias (ed.) et al., Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 8th international conference, CPAIOR 2011, Berlin, Germany, May 23–27, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21310-6/pbk). Lecture Notes in Computer Science 6697, 230-245 (2011).
MSC:  90B35 68T20
PDF BibTeX XML Cite
Full Text: DOI

Scheduling problems. (English) Zbl 1203.90063

Paschos, Vangelis Th., Combinatorial optimization. Volume 2: Paradigms of combinatorial optimization. Problems and new approaches. London: ISTE; Hoboken, NJ: John Wiley & Sons (ISBN 978-1-84821-148-3/hbk; 978-1-84821-146-9/set). 33-59 (2010).
MSC:  90B35 90C05 90C27
PDF BibTeX XML Cite

Lazy constraint imposing for improving the path constraint. (English) Zbl 1291.68380

Corradini, Andrea (ed.), Proceedings of the 5th international workshop on computing with terms and graphs (TERMGRAPH 2009), York, UK, March 22, 2009. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 253, No. 4, 113-128 (2009).
MSC:  68T20 68R10 92C40
PDF BibTeX XML Cite
Full Text: DOI

Max energy filtering algorithm for discrete cumulative resources. (English) Zbl 1241.90125

van Hoeve, Willem-Jan (ed.) et al., Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 6th international conference, CPAIOR 2009, Pittsburgh, PA, USA, May 27–31, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-01928-9/pbk). Lecture Notes in Computer Science 5547, 294-308 (2009).
MSC:  90C27 90B35
PDF BibTeX XML Cite
Full Text: DOI

Constraint propagation with tabu list for min-span frequency assignment problem. (English) Zbl 1160.90515

Le Thi, Hoai An (ed.) et al., Modelling, computation and optimization in information systems and management sciences. Second international conference MCO 2008, Metz, France - Luxembourg, September 8–10, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-87476-8/pbk). Communications in Computer and Information Science 14, 97-106 (2008).
MSC:  90B50
PDF BibTeX XML Cite
Full Text: DOI

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Classification

all top 3

Software