From de12e04b1e5f11e3e39012008175f503df5584ff Mon Sep 17 00:00:00 2001 From: Max Schweikart Date: Thu, 28 Sep 2023 15:17:03 +0200 Subject: [PATCH 1/3] feat: implement problem mask for QUBO --- src/components/landing-page/ProblemCard.tsx | 2 +- .../landing-page/ProblemChooser.tsx | 11 ++++- src/pages/solve/QUBO.tsx | 47 +++++++++++++++++++ 3 files changed, 58 insertions(+), 2 deletions(-) create mode 100644 src/pages/solve/QUBO.tsx diff --git a/src/components/landing-page/ProblemCard.tsx b/src/components/landing-page/ProblemCard.tsx index e280c07..9f1d247 100644 --- a/src/components/landing-page/ProblemCard.tsx +++ b/src/components/landing-page/ProblemCard.tsx @@ -16,7 +16,7 @@ export const ProblemCard = (props: ProblemCardProps) => { {props.new && ( - New + New! )} ( new={false} tags={["sub-routines"]} problemName="Feature Model Anomaly" - description="For a given feature model, check for Void Feature Model, Dead Features, False-Optional Features, Redundant Constraints.." + description="Check whether a given feature model in the UVL format is void or if it has dead features." + /> + + + diff --git a/src/pages/solve/QUBO.tsx b/src/pages/solve/QUBO.tsx new file mode 100644 index 0000000..0d96547 --- /dev/null +++ b/src/pages/solve/QUBO.tsx @@ -0,0 +1,47 @@ +import Head from "next/head"; +import React, { useState } from "react"; +import type { NextPage } from "next"; +import { TextArea } from "../../components/solvers/SAT/TextArea"; +import { ProgressHandler } from "../../components/solvers/ProgressHandler"; +import { Text, Divider, Heading, Spacer, Code } from "@chakra-ui/react"; +import { Layout } from "../../components/layout/Layout"; +import { EditorControls } from "../../components/solvers/EditorControls"; +import { baseUrl } from "../../api/ToolboxAPI"; + +const QUBO: NextPage = () => { + const [quboTerm, setQuboTerm] = useState(""); + + return ( + + + ProvideQ + + + {/* TODO: replace favicon */} + + + QUBO Solver + + In the Quadratic Unconstrained Binary Optimization problem, we try to + find the assignment for a finite amount of 0/1 + decision variables that minimizes a given quadratic term with these + variables. The problem statement is given in the LP format and all + solvers will present a variable assigment as a solution. + + + + + +