<--- Back to Details
First PageDocument Content
Theoretical computer science / Mathematics / Mathematical optimization / Numerical analysis / Combinatorial optimization / Operations research / Constraint programming / Logic in computer science / Maximum satisfiability problem / Linear programming / Constrained optimization / Solver
Date: 2010-05-18 11:55:34
Theoretical computer science
Mathematics
Mathematical optimization
Numerical analysis
Combinatorial optimization
Operations research
Constraint programming
Logic in computer science
Maximum satisfiability problem
Linear programming
Constrained optimization
Solver

Boolean Lexicographic Optimization Joao Marques-Silva1 , Josep Argelich2 , Ana Grac¸a3 , and Inˆes Lynce3 1 2 CSI/CASL, University College Dublin, Ireland

Add to Reading List

Source URL: ceur-ws.org

Download Document from Source Website

File Size: 481,53 KB

Share Document on Facebook

Similar Documents

arXiv:1807.01672v2 [cs.LG] 6 JulRanked Reward: Enabling Self-Play Reinforcement Learning for Combinatorial Optimization  Alexandre Laterre

arXiv:1807.01672v2 [cs.LG] 6 JulRanked Reward: Enabling Self-Play Reinforcement Learning for Combinatorial Optimization Alexandre Laterre

DocID: 1xTSz - View Document

APPROX 2012 and RANDOM 2012 15th Intl. Workshop on Approx. Algorithms for Combinatorial Optimization Problems - APPROX 2012 & 16th Intl. Workshop on Randomization and Computation - RANDOM 2012 http://cui.unige.ch/tcs/ran

APPROX 2012 and RANDOM 2012 15th Intl. Workshop on Approx. Algorithms for Combinatorial Optimization Problems - APPROX 2012 & 16th Intl. Workshop on Randomization and Computation - RANDOM 2012 http://cui.unige.ch/tcs/ran

DocID: 1vegv - View Document

⋆ Combinatorial Optimization (Oberwolfach, November 9–15, Discrete DC Programming by Discrete Convex Analysis —Use of Conjugacy— Kazuo Murota (U. Tokyo)

⋆ Combinatorial Optimization (Oberwolfach, November 9–15, Discrete DC Programming by Discrete Convex Analysis —Use of Conjugacy— Kazuo Murota (U. Tokyo)

DocID: 1uRbH - View Document

Research Summary∗ Chandra Nair Overview In my early research career I considered random versions of combinatorial optimization problems; my doctoral thesis [17] resolved a long-standing conjecture about the assignment

Research Summary∗ Chandra Nair Overview In my early research career I considered random versions of combinatorial optimization problems; my doctoral thesis [17] resolved a long-standing conjecture about the assignment

DocID: 1uvqi - View Document

In silico optimization of a guava antimicrobial peptide enables combinatorial exploration for peptide design

In silico optimization of a guava antimicrobial peptide enables combinatorial exploration for peptide design

DocID: 1u55o - View Document